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

DOI10.1109/18.179366zbMATH Open0765.94014OpenAlexW2095978440MaRDI QIDQ4034460FDOQ4034460

Authors: Tadao Kasami, Toyoo Takata, Toru Fujiwara, Shu Lin 

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

Recommendations

• On complexity of trellis structure of linear block codes
• On the intractability of permuting a block code to minimize trellis complexity
• On trellis structures for Reed-Muller codes
• Trellis complexity of linear block codes via atomic codewords
• On bit-level trellis complexity of Reed-Muller codes

zbMATH Keywords

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (17)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4034460)