Title :
On the generalized Hamming weights of product codes
Author :
Wei, Victor K. ; Yang, Kyeongcheol
Author_Institution :
Bellcore, Morristown, NJ, USA
fDate :
9/1/1993 12:00:00 AM
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. The authors derive several results on expressing the generalized Hamming weights of a product code in terms of those of its component codes. They also formulate a general conjecture
Keywords :
Hamming codes; cryptography; encoding; trellis codes; cryptography; generalized Hamming weights; linear code; product codes; subcode; trellis coding; Block codes; Cryptography; Dynamic programming; Hamming weight; Linear code; Maximum likelihood decoding; Notice of Violation; Parity check codes; Product codes; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
