A note on tailbiting codes and their feedback encoders

DOI10.1109/18.979329MaRDI QIDQ4544808zbMATH OpenOpenAlexFDO

Authors P. Ståhl, John B. Anderson, Rolf Johannesson

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.979329

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• On Tail Biting Convolutional Codes
• A note on performance of generalized tail biting trellis codes
• A note on systematic tailbiting encoders
• An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels
• Tailbiting codes: bounds and search results
• Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes
• scientific article; zbMATH DE number 3458473
• A note on the decoding complexity of error-correcting codes
• Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
• Code construction and decoding of parallel concatenated tail-biting codes

Cited in

(4)

• Best short rate 1/2 tailbiting codes for the bit-error rate criterion
• Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
• A note on systematic tailbiting encoders
• On Tail Biting Convolutional Codes

This page was built for publication: A note on tailbiting codes and their feedback encoders

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