A note on performance of generalized tail biting trellis codes

DOI10.1080/09720529.2010.10698280zbMath1215.94003OpenAlexW2109700478MaRDI QIDQ3005858

Masao Kasahara, Shigeichi Hirasawa

Publication date: 10 June 2011

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

Full work available at URL: http://www.connectjournals.com/file_html_pdf/592202H_jdmsc337_105-122a.pdf

zbMATH Keywords

concatenated codesblock codeserror exponentdecoding complexitytail bitingTrellis code

Mathematics Subject Classification ID

Decoding (94B35) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cites Work

• Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes
• On Tail Biting Convolutional Codes
• Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
• Convolutional codes II. Maximum-likelihood decoding
• The complexity of decoders--II: Computational work and decoding time

This page was built for publication: A note on performance of generalized tail biting trellis codes