Further results on binary convolutional codes with an optimum distance profile

Rolf Johannesson; Erik Paaske

doi:10.1109/TIT.1978.1055850

Further results on binary convolutional codes with an optimum distance profile

Rolf Johannesson, Erik Paaske

Research output: Contribution to journal › Letter › peer-review

357 Downloads (Pure)

Abstract

Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit the search for codes with a large value ofd_{infty}. We present extensive lists of such robustly optimal codes containing rateR = l/2nonsystematic codes, several withd_{infty}superior to that of any previously known code of the same rate and memory; rateR = 2/3systematic codes; and rateR = 2/3nonsystematic codes. As a counterpart to quick-look-in (QLI) codes which are not "transparent," we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes with a feedforward inverse(1 + D,D). In general, ELIT codes haved_{infty}superior to that of QLI codes.

Original language	English
Journal	I E E E Transactions on Information Theory
Volume	24
Issue number	2
Pages (from-to)	264-268
ISSN	0018-9448
DOIs	https://doi.org/10.1109/TIT.1978.1055850
Publication status	Published - 1978

Bibliographical note

Copyright: 1978 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Access to Document

10.1109/TIT.1978.1055850

PaaskeFinal published version, 751 KB

Fingerprint Dive into the research topics of 'Further results on binary convolutional codes with an optimum distance profile'. Together they form a unique fingerprint.

Cite this

@article{c5a14ae74fce4fdabb9b549b43b0fe7a,

title = "Further results on binary convolutional codes with an optimum distance profile",

abstract = "Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit the search for codes with a large value ofd_{infty}. We present extensive lists of such robustly optimal codes containing rateR = l/2nonsystematic codes, several withd_{infty}superior to that of any previously known code of the same rate and memory; rateR = 2/3systematic codes; and rateR = 2/3nonsystematic codes. As a counterpart to quick-look-in (QLI) codes which are not {"}transparent,{"} we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes with a feedforward inverse(1 + D,D). In general, ELIT codes haved_{infty}superior to that of QLI codes.",

author = "Rolf Johannesson and Erik Paaske",

note = "Copyright: 1978 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE",

year = "1978",

doi = "10.1109/TIT.1978.1055850",

language = "English",

volume = "24",

pages = "264--268",

journal = "I E E E Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "2",

}

TY - JOUR

T1 - Further results on binary convolutional codes with an optimum distance profile

AU - Johannesson, Rolf

AU - Paaske, Erik

N1 - Copyright: 1978 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

PY - 1978

Y1 - 1978

N2 - Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit the search for codes with a large value ofd_{infty}. We present extensive lists of such robustly optimal codes containing rateR = l/2nonsystematic codes, several withd_{infty}superior to that of any previously known code of the same rate and memory; rateR = 2/3systematic codes; and rateR = 2/3nonsystematic codes. As a counterpart to quick-look-in (QLI) codes which are not "transparent," we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes with a feedforward inverse(1 + D,D). In general, ELIT codes haved_{infty}superior to that of QLI codes.

AB - Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit the search for codes with a large value ofd_{infty}. We present extensive lists of such robustly optimal codes containing rateR = l/2nonsystematic codes, several withd_{infty}superior to that of any previously known code of the same rate and memory; rateR = 2/3systematic codes; and rateR = 2/3nonsystematic codes. As a counterpart to quick-look-in (QLI) codes which are not "transparent," we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes with a feedforward inverse(1 + D,D). In general, ELIT codes haved_{infty}superior to that of QLI codes.

U2 - 10.1109/TIT.1978.1055850

DO - 10.1109/TIT.1978.1055850

M3 - Letter

VL - 24

SP - 264

EP - 268

JO - I E E E Transactions on Information Theory

JF - I E E E Transactions on Information Theory

SN - 0018-9448

IS - 2

ER -