On the trellis complexity of block and convolutional codes
zbMATH Open0901.94032MaRDI QIDQ1389282FDOQ1389282
Authors: U. Dettmar, R. Raschhofer, Ulrich Sorger 
Publication date: 16 July 1998
Published in: Problems of Information Transmission (Search for Journal in Brave)
Recommendations
complexitymaximum likelihood decodingblock codesdecoding complexity of PUM codespunctured convolutional codessyndrome trellistrellis Viterbi-type decoding algorithmsupper bound on the minimal trellis complexity
Convolutional codes (94B10) Decoding (94B35) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Cited In (14)
- A comparison of trellis modules for binary convolutional codes
- Variable-complexity trellis decoding of binary convolutional codes
- Error-trellises for convolutional codes. II: Decoding methods
- Decoding of convolutional codes using a syndrome trellis
- Links between complexity theory and constrained block coding
- On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
- Bounds on the trellis size of linear block codes
- Bounds on complexity of trellis decoding of linear block codes
- On the trellis representation of the Delsarte-Goethals codes
- Trellis complexity versus the coding gain of lattices. II
- Complexity and sliding-block decodability
- Trellis complexity of linear block codes via atomic codewords
- Title not available (Why is that?)
- The trellis complexity of convolutional codes
This page was built for publication: On the trellis complexity of block and convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389282)
