On the generalized Hamming weights of product codes
- 1 January 1993
- journal article
- letter
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (5), 1709-1713
- https://doi.org/10.1109/18.259662
Abstract
The rth generalized Hamming weight of a linear code is the minimum support size of any r-dimensional subcode. It has been found useful in the studies of cryptography and trellis coding. We derive several results on expressing the generalized Hamming weights of a product code in terms of those of its component codes. We also formulate a general conjecture.Keywords
This publication has 10 references indexed in Scilit:
- Scheduling with generalized batch delivery dates and earliness penaltiesIIE Transactions, 2000
- Minimum support weights of binary codesIEEE Transactions on Information Theory, 1993
- On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codesIEEE Transactions on Information Theory, 1993
- Bounds on the trellis size of linear block codesIEEE Transactions on Information Theory, 1993
- 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
- Generalized Hamming weights for linear codesIEEE Transactions on Information Theory, 1991
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Minimal trellises for block codesIEEE Transactions on Information Theory, 1988
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978