DocumentCode
2618711
Title
Density/length profiles and trellis complexity of linear block codes and lattices
Author
Forney, G. David, Jr.
Author_Institution
Motorola, Mansfield, MA, USA
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
339
Abstract
The dimension/length profile (DLP) of a linear code C is equivalent to its generalized Hamming weight (GHW) hierarchy. The trellis complexity of C is intimately related to its DLP; indeed, these two topics should be regarded as parts of the same subject. Using this concept,easy proofs of unknown results and some new results are given. An analogous concept is introduced for lattices, the density/length profile (DLP). Analogous results are derived, which however look quite different
Keywords
block codes; computational complexity; linear codes; trellis codes; density/length profile; dimension/length profile; generalized Hamming weight hierarchy; lattices; linear block codes; trellis complexity; Block codes; Hamming weight; Lattices; Linear code; State-space methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394679
Filename
394679
Link To Document