On maximum length convolutional codes under a trellis complexity constraint
From MaRDI portal
Publication:1827577
DOI10.1016/j.jco.2003.08.018zbMath1064.94017OpenAlexW2071675087MaRDI QIDQ1827577
Publication date: 6 August 2004
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2003.08.018
convolutional codestrellis complexitychannel codinghigh rate codesmaximum length convolutional codes
Related Items (1)
Cites Work
- Unnamed Item
- The trellis complexity of convolutional codes
- Sphere-Packing Bounds for Convolutional Codes
- Minimal trellises for block codes
- Coset codes. II. Binary lattices and related codes
- Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Decoding of convolutional codes using a syndrome trellis
- On classes of rate k/(k+1) convolutional codes and their decoding techniques
- Rational rate punctured convolutional codes for soft-decision Viterbi decoding
- Cosets of convolutional codes with least possible maximum zero- and one-run lengths
- On classes of convolutional codes that are not asymptotically catastrophic
- Tailbiting codes obtained via convolutional codes with large active distance-slopes
- On the BCJR trellis for linear block codes
This page was built for publication: On maximum length convolutional codes under a trellis complexity constraint
