Name: Minimum support weights of binary codes
Creator: Torleiv Kløve
Keywords: binary linear code, weight hierarchy, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Hamming weight, support weight, 01 natural sciences, Linear codes (general theory)

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1993Publisher:Institute of Electrical and Electronics Engineers (IEEE)Journal:IEEE Transactions on Information Theory, volume 39, pages 648-654 (issn: 0018-9448,

Authors: Torleiv Kløve;

doi: 10.1109/18.212298

Minimum support weights of binary codes

- Summary
- Subjects
- Metrics

Abstract

Summary: The minimum support weight, \(d_ r(C)\), of a binary linear code \(C\) is the size of the smallest support of any \(r\)-dimensional subcode of \(C\). The weight hierarchy of \(C\) is the set \(\{d_ r(C)|\) \(1\leq r\leq k\}\). Some relations between the minimum support weights are discussed. In particular, the possible weight hierarchies of codes of dimension 4 are determined.

Related Organizations

University of Bergen
Norway

Keywords

binary linear code, weight hierarchy, Hamming weight, support weight, Linear codes (general theory)

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	28
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%