On codes satisfying the double chain condition

DOI10.1016/S0012-365X(96)00149-5zbMath0898.94014MaRDI QIDQ1377755

Torleiv Kløve

Publication date: 26 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

boundsweight hierarchydouble chain conditiontrellis complexity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (2)

On linear projective codes which satisfy the chain condition. ⋮ Projective codes which satisfy the chain condition

Cites Work

• Support weight distribution of linear codes
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of linear codes
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• Minimum support weights of binary codes
• Codes satisfying the chain condition
• Maximum-likelihood soft decision decoding of BCH codes
• Asymptotically good codes have infinite trellis complexity
• Dimension/length profiles and trellis complexity of linear block codes
• Density/length profiles and trellis complexity of lattices

This page was built for publication: On codes satisfying the double chain condition