Minimal tail-biting trellises for certain cyclic block codes are easy to construct

DOI10.1007/3-540-48224-5_52MaRDI QIDQ4535052zbMATH OpenFDO

Authors Priti Shankar, P. N. Kumar, Harmeet Singh, Balaji Sundar Rajan

Publication date 12 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2076/20760627, http://eprints.iisc.ac.in/1919/1/minimal_tail.pdf

zbMATH Keywords

cyclic codeslinear block codesReed-Solomon codestail-biting trellises

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cyclic codes (94B15)

Recommendations

• The structure of tail-biting trellises: Minimality and basic principles
• Minimal tail-biting trellises: the Golay code and more
• Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes
• Tailbiting codes: bounds and search results
• Minimal trellises for block codes

Cited in

(8)

• On viewing block codes as finite automata.
• Matrix theory for minimal trellises
• An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
• The structure of tail-biting trellises: Minimality and basic principles
• Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes
• Minimal trellises for block codes
• scientific article; zbMATH DE number 1498805 (Why is no real title available?)
• Minimal tail-biting trellises: the Golay code and more

This page was built for publication: Minimal tail-biting trellises for certain cyclic block codes are easy to construct

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