Minimal tail-biting trellises: the Golay code and more
From MaRDI portal
Recommendations
- The structure of tail-biting trellises: Minimality and basic principles
- scientific article; zbMATH DE number 1756449
- Tailbiting codes: bounds and search results
- Low complexity tail-biting trellises of self-dual codes of length 24, 32 and 40 over GF(2) and \({\mathbb Z}_4\) of large minimum distance
- Minimal tail-biting trellises for certain cyclic block codes are easy to construct
Cited in
(12)- On viewing block codes as finite automata.
- \(M_{24}\)-orbits of octad triples
- The generalization of some trellis properties of linear codes to group codes
- Matrix theory for minimal trellises
- The structure of tail-biting trellises: Minimality and basic principles
- Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes
- Low complexity tail-biting trellises of self-dual codes of length 24, 32 and 40 over GF(2) and \({\mathbb Z}_4\) of large minimum distance
- Minimal tail-biting trellises for certain cyclic block codes are easy to construct
- scientific article; zbMATH DE number 1756449 (Why is no real title available?)
- Tailbiting codes: bounds and search results
- scientific article; zbMATH DE number 2154150 (Why is no real title available?)
- Codes on graphs: Recent progress
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)