Rational rate punctured convolutional codes for soft-decision Viterbi decoding

Authors:
I. E. Bocharova;B. D. Kudryashov
Affiliations:
Dept. of Inf. Syst., St. Petersburg Acad. of Airspace Instrum.;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

On maximum length convolutional codes under a trellis complexity constraint

Journal of Complexity - Special issue on coding and cryptography
Convolutional codes under a minimal trellis complexity measure

IEEE Transactions on Communications
Searching for high-rate convolutional codes via binary syndrome trellises

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
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

Quantified Score

Hi-index	754.84

Visualization

Abstract

We present rational rate k/n punctured convolutional codes (n up to 8, k=1, ···, n-1, and constraint length ν up to 8) with good performance. Many of these codes improve the free distance and (or) weight spectra over previously reported codes with the same parameters. The tabulated codes are found by an exhaustive (or a random) search