Density/length profiles and trellis complexity of linear block codes and lattices

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 res...

Full description

Saved in:
Bibliographic Details
Published inProceedings Nineteen Ninety-Four IEEE International Symposium on Information Theory p. 339
Main Author Forney, G.D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1994
Subjects
Block codes
Hamming weight
Lattices
Linear code
State-space methods
Online AccessGet full text
ISBN0780320158
9780780320154
DOI10.1109/ISIT.1994.394679

Cover

More Information
Summary: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.< >
ISBN:0780320158
9780780320154
DOI:10.1109/ISIT.1994.394679