Tailbiting codes: bounds and search results

DOI10.1109/18.971744zbMATH Open1059.94026OpenAlexW2104336575MaRDI QIDQ4544769FDOQ4544769

Authors: P. Ståhl, Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov 

Publication date: 4 August 2002

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

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

Recommendations

• Minimal tail-biting trellises: the Golay code and more
• Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
• The structure of tail-biting trellises: Minimality and basic principles
• Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
• Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes

Mathematics Subject Classification ID

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

Cited In (10)

• Quasi-cyclic codes from cyclic-structured designs with good properties
• A BEAST for Prowling in Trees
• Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes
• Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
• Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
• Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
• A note on tailbiting codes and their feedback encoders
• A note on performance of generalized tail biting trellis codes
• Title not available (Why is that?)
• Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes

This page was built for publication: Tailbiting codes: bounds and search results

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