Minimal tail-biting trellises: the Golay code and more

DOI10.1109/18.771145zbMATH Open0965.94024OpenAlexW2112682069MaRDI QIDQ4701404FDOQ4701404

Authors: Robert Calderbank, Alexander Vardy, G. David jun. Forney 

Publication date: 21 November 1999

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

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

Recommendations

• The structure of tail-biting trellises: Minimality and basic principles
• scientific article; zbMATH DE number 1756449
• Tailbiting codes: bounds and search results
• scientific article; zbMATH DE number 2081122
• scientific article; zbMATH DE number 1754625

zbMATH Keywords

convolutional codesbinary Hamming codebinary Golay codeiterative decoding\(\mathbb{Z}_4\)-linear octacodetail-biting trellis representations of block codesternary tetracode

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12)

Cited In (12)

• Matrix theory for minimal trellises
• Codes on graphs: Recent progress
• \(M_{24}\)-orbits of octad triples
• Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes
• On viewing block codes as finite automata.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tailbiting codes: bounds and search results
• Title not available (Why is that?)
• The structure of tail-biting trellises: Minimality and basic principles
• The generalization of some trellis properties of linear codes to group codes
• Title not available (Why is that?)

This page was built for publication: Minimal tail-biting trellises: the Golay code and more

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