Convolutional codes under a minimal trellis complexity measure

Authors:
Bartolomeu F. Uchôa-Filho;Richard Demo Souza;Cecilio Pimentel;Marcel Jar
Affiliations:
GPqCom, EEL, CTC, UFSC, Florianópolis, SC, Brazil;DAELN, CPGEI, UTFPR, Curitiba, PR, Brazil;CODEC, DES, UFPE, Recife, PE, Brazil;CODEC, DES, UFPE, Recife, PE, Brazil
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 5
Cited 2

Error Control Coding, Second Edition

Error Control Coding, Second Edition
On maximum length convolutional codes under a trellis complexity constraint

Journal of Complexity - Special issue on coding and cryptography
A directed search approach for unit-memory convolutional codes

IEEE Transactions on Information Theory
The trellis complexity of convolutional codes

IEEE Transactions on Information Theory - Part 1
Rational rate punctured convolutional codes for soft-decision Viterbi decoding

IEEE Transactions on Information Theory

Numerically efficient algorithm for modified trellis approaches

IEEE Transactions on Communications
New constructions of high-performance low-complexity convolutional codes

IEEE Transactions on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We conduct a code search, restricted to the recently introduced class of generalized punctured convolutional codes, under the minimal trellis complexity measure defined by McEliece and Lin. For the same decoding complexity and the same code rate, new codes are compared to well-known existing classes of convolutional codes. Some of the best convolutional codes (in a distance spectrum sense) of existing and new trellis complexities are tabulated.