On the BCJR trellis for linear block codes
IEEE Transactions on Information Theory
The trellis complexity of convolutional codes
IEEE Transactions on Information Theory - Part 1
On classes of rate k/(k+1) convolutional codes and their decoding techniques
IEEE Transactions on Information Theory - Part 2
Rational rate punctured convolutional codes for soft-decision Viterbi decoding
IEEE Transactions on Information Theory
Cosets of convolutional codes with least possible maximum zero- and one-run lengths
IEEE Transactions on Information Theory
On classes of convolutional codes that are not asymptotically catastrophic
IEEE Transactions on Information Theory
Sphere-packing bounds for convolutional codes
IEEE Transactions on Information Theory
Convolutional codes under a minimal trellis complexity measure
IEEE Transactions on Communications
New constructions of low-complexity convolutional codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
New constructions of high-performance low-complexity convolutional codes
IEEE Transactions on Communications
| Hi-index | 0.02 |
We look at convolutional codes with maximum possible code length for prescribed redundancy, conditioned on constraints on the free distance and on the bit-oriented trellis state complexity. Rate (n - 1)/n codes have been studied to some extent in the literature, but more general rates have not been studied much. In this work we consider convolutional codes of rate (n - r)/n, r ≥ 1. Explicit construction techniques for free distance dfree = 3 and 4 codes are described. For codes with r = 2, an efficient exhaustive search algorithm is outlined. For the more general case with r ≥ 2, a heuristic approach is suggested. Several new codes were found for r = 1 and in particular for r = 2 and 3. Compared to previously known codes of similar free distance and complexity constraints, the new codes have either strictly higher rate, or the same rate but smaller low distance multiplicities.