Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4

Erik Paaske

Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4

Erik Paaske

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

796 Downloads (Orbit)

Abstract

A search procedure is developed to find good short binary(N,N - 1)convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distanced_{free}either cannot achieve the maximum value or is equal tod_{free}of some code in the remaining set. Farther, the search among the remaining codes is started in a subset in which we expect the possibility of finding codes with large values ofd_{free}to be good. A number of short, optimum (in the sense of maximizingd_{free}), rate-2/3 and 3/4 codes found by the search procedure are listed.

Original language	English
Journal	I E E E Transactions on Information Theory
Volume	20
Issue number	5
Pages (from-to)	683-689
ISSN	0018-9448
Publication status	Published - 1974

Bibliographical note

Copyright: 1974 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

Full textFinal published version, 1.12 MB

OpenUrl availability

Check availability in DTU Findit

Cite this

@article{0a11092c9ef4472abc64802aa2d53af5,

title = "Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4",

abstract = "A search procedure is developed to find good short binary(N,N - 1)convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distanced\_\{free\}either cannot achieve the maximum value or is equal tod\_\{free\}of some code in the remaining set. Farther, the search among the remaining codes is started in a subset in which we expect the possibility of finding codes with large values ofd\_\{free\}to be good. A number of short, optimum (in the sense of maximizingd\_\{free\}), rate-2/3 and 3/4 codes found by the search procedure are listed.",

author = "Erik Paaske",

note = "Copyright: 1974 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 = "1974",

language = "English",

volume = "20",

pages = "683--689",

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

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4

AU - Paaske, Erik

N1 - Copyright: 1974 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 - 1974

Y1 - 1974

N2 - A search procedure is developed to find good short binary(N,N - 1)convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distanced_{free}either cannot achieve the maximum value or is equal tod_{free}of some code in the remaining set. Farther, the search among the remaining codes is started in a subset in which we expect the possibility of finding codes with large values ofd_{free}to be good. A number of short, optimum (in the sense of maximizingd_{free}), rate-2/3 and 3/4 codes found by the search procedure are listed.

AB - A search procedure is developed to find good short binary(N,N - 1)convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distanced_{free}either cannot achieve the maximum value or is equal tod_{free}of some code in the remaining set. Farther, the search among the remaining codes is started in a subset in which we expect the possibility of finding codes with large values ofd_{free}to be good. A number of short, optimum (in the sense of maximizingd_{free}), rate-2/3 and 3/4 codes found by the search procedure are listed.

M3 - Letter

SN - 0018-9448

VL - 20

SP - 683

EP - 689

JO - I E E E Transactions on Information Theory

JF - I E E E Transactions on Information Theory

IS - 5

ER -

Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4

Abstract

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this