A comparison of trellis modules for binary convolutional codes

DOI10.1109/26.725298MaRDI QIDQ2714805zbMATH OpenOpenAlexFDO

Authors Kjell Jørgen Hole

Publication date 14 August 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

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

zbMATH Keywords

convolutional codelogarithmic trellis complexitytrellis moduleViterbi decoding

Mathematics Subject Classification ID

Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Minimal Trellis Modules and Equivalent Convolutional Codes
• The trellis complexity of convolutional codes
• On the trellis complexity of block and convolutional codes
• Variable-complexity trellis decoding of binary convolutional codes
• Decoding of convolutional codes using a syndrome trellis

Cited in

(4)

• Performance evaluation of coded modulation schemes based on binary lattices
• Minimal Trellis Modules and Equivalent Convolutional Codes
• Analysis and design of trellis codes optimized for a binary symmetric Markov source with MAP detection
• scientific article; zbMATH DE number 820513 (Why is no real title available?)

This page was built for publication: A comparison of trellis modules for binary convolutional codes

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