DocumentCode
935335
Title
New short constraint length convolutional code constructions for selected rational rates (Corresp.)
Author
Daut, David G. ; Modestino, James W. ; Wismer, Lee D.
Volume
28
Issue
5
fYear
1982
fDate
9/1/1982 12:00:00 AM
Firstpage
794
Lastpage
800
Abstract
New short constraint length convolutional code constructions are tabulated for rates
with
, and for constraint lengths
. These codes have been determined by iterative search based upon a criterion of optimizing the free distance profile. Specifically, these codes maximize the free distance
while minimizing the number of adversaries in the distance, or weight, spectrum. In several instances we demonstrate the superiority of these codes over previously published code constructions at the same rate and constraint length. These codes are expected to have a number of applications, including combined source-channel coding schemes as well as coding for burst or impulsive noise channels.
with
, and for constraint lengths
. These codes have been determined by iterative search based upon a criterion of optimizing the free distance profile. Specifically, these codes maximize the free distance
while minimizing the number of adversaries in the distance, or weight, spectrum. In several instances we demonstrate the superiority of these codes over previously published code constructions at the same rate and constraint length. These codes are expected to have a number of applications, including combined source-channel coding schemes as well as coding for burst or impulsive noise channels.Keywords
Convolutional codes; Decoding; Equations; Polynomials; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1982.1056558
Filename
1056558
Link To Document