The structure of tail-biting trellises: Minimality and basic principles
From MaRDI portal
Publication:3547142
DOI10.1109/TIT.2003.815769zbMATH Open1301.94141MaRDI QIDQ3547142FDOQ3547142
Authors: R. Kötter, Alexander Vardy
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Cited In (10)
- Title not available (Why is that?)
- A note on characteristic generators of a free cyclic code and its dual
- Matrix theory for minimal trellises
- Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes
- Title not available (Why is that?)
- Tailbiting codes: bounds and search results
- Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
- Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
- The generalization of some trellis properties of linear codes to group codes
- Title not available (Why is that?)
This page was built for publication: The structure of tail-biting trellises: Minimality and basic principles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547142)