On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes

DOI10.1109/18.179366zbMath0765.94014OpenAlexW2095978440MaRDI QIDQ4034460

Toyoo Takata, Tadao Kasami, Shu Lin, Toru Fujiwara

Publication date: 16 May 1993

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.179366

zbMATH Keywords

Reed-Muller codeBCH codeminimal trellis diagramgeneralized Hamming weight hierarchyoptimum bit order

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (14)

Higher Hamming weights for locally recoverable codes on algebraic curves ⋮ Finite projective geometries and classification of the weight hierarchies of codes. I ⋮ Onm-MDS codes over finite fields ⋮ The weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes ⋮ Code constructions and existence bounds for relative generalized Hamming weight ⋮ On codes satisfying the double chain condition ⋮ The weight hierarchies and generalized weight spectra of the projective codes from degenerate quadrics ⋮ The weight hierarchies of \(q\)-ary linear codes of dimension 4 ⋮ Relative generalized Hamming weights of cyclic codes ⋮ Moments of the support weight distribution of linear codes ⋮ On trellis structures for Reed-Muller codes ⋮ Weight hierarchies of linear codes of dimension 3 ⋮ Support weight enumerators and coset weight distributions of isodual codes ⋮ Matrix characterization of linear codes with arbitrary Hamming weight hierarchy

This page was built for publication: On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes