Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes

DOI10.1080/09720529.2006.10698080zbMath1104.94060OpenAlexW1993301973MaRDI QIDQ3410907

Masao Kasahara, Shigeichi Hirasawa

Publication date: 16 November 2006

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2006.10698080

zbMATH Keywords

concatenated codesasymptotic resultsblock codeserror exponentdecoding complexitytail biting convolutional codes

Mathematics Subject Classification ID

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

Related Items (1)

A note on performance of generalized tail biting trellis codes

Cites Work

• On Tail Biting Convolutional Codes
• Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
• Code construction and decoding of parallel concatenated tail-biting codes
• Convolutional codes II. Maximum-likelihood decoding
• The complexity of decoders--II: Computational work and decoding time

This page was built for publication: Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes