New short constraint length convolutional code constructions are tabulated for ratesR=(n-k)/n, k=1,2, cdots ,n-1withn=2, 3,cdots ,8, and for constraint lengthsK=3,4, cdots,8. These codes have been determined by iterative search based upon a criterion of optimizing the free distance profile. Specifically, these codes maximize the free distanced_{f}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.
Published in:
Information Theory, IEEE Transactions on
(Volume:28
,
Issue:
5
)
Date of Publication:
Sep 1982
- Page(s):
-
794
-
800
- ISSN :
-
0018-9448
- Digital Object Identifier :
-
10.1109/TIT.1982.1056558
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 January 2003
- Issue Date :
-
Sep 1982
- Sponsored by :
-
IEEE Information Theory Society