Minimum support weights of binary codes
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (2), 648-654
- https://doi.org/10.1109/18.212298
Abstract
Some relations between the minimum support weights are discussed. In particular, the possible weight hierarchies of codes of dimension 4 are determinedKeywords
This publication has 8 references indexed in Scilit:
- Generalized Hamming weights of linear codesIEEE Transactions on Information Theory, 1992
- On the generalized Hamming weights of several classes of cyclic codsIEEE Transactions on Information Theory, 1992
- Optimal codes for error detectionIEEE Transactions on Information Theory, 1992
- Generalized Hamming weights for linear codesIEEE Transactions on Information Theory, 1991
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1987
- Wire-Tap Channel IIAT&T Bell Laboratories Technical Journal, 1984
- The weight distribution of linear codes over GF(ql) having generator matrix over GF(q>)Discrete Mathematics, 1978
- The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)Discrete Mathematics, 1977