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

Erik Paaske

Research output: Contribution to journalLetterpeer-review

340 Downloads (Pure)

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 languageEnglish
JournalI E E E Transactions on Information Theory
Volume20
Issue number5
Pages (from-to)683-689
ISSN0018-9448
Publication statusPublished - 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

Fingerprint Dive into the research topics of 'Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4'. Together they form a unique fingerprint.

Cite this