New convolutional code constructions and a class of asymptotically good time-varying codes

Jørn Justesen

New convolutional code constructions and a class of asymptotically good time-varying codes

Jørn Justesen

Research output: Contribution to journal › Journal article › Research › peer-review

502 Downloads (Pure)

Abstract

We show that the generator polynomials of certain cyclic codes define noncatastrophic fixed convolutional codes whose free distances are lowerbounded by the minimum distances of the cyclic codes. This result is used to construct convolutioual codes with free distance equal to the constraint length and to derive convolutional codes with good free distances from the BCH codes. Finally, a class of time-varying codes is constructed for which the free distance increases linearly with the constraint length.

Original language	English
Journal	I E E E Transactions on Information Theory
Volume	19
Issue number	2
Pages (from-to)	220-225
ISSN	0018-9448
Publication status	Published - 1973

Bibliographical note

Copyright 1973 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

JustesenFinal published version, 870 KB

OpenUrl availability

Full text

Cite this

@article{69ab5c0c84244423919876b8cd51465d,

title = "New convolutional code constructions and a class of asymptotically good time-varying codes",

abstract = "We show that the generator polynomials of certain cyclic codes define noncatastrophic fixed convolutional codes whose free distances are lowerbounded by the minimum distances of the cyclic codes. This result is used to construct convolutioual codes with free distance equal to the constraint length and to derive convolutional codes with good free distances from the BCH codes. Finally, a class of time-varying codes is constructed for which the free distance increases linearly with the constraint length.",

author = "J{\o}rn Justesen",

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

language = "English",

volume = "19",

pages = "220--225",

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

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "2",

}

TY - JOUR

T1 - New convolutional code constructions and a class of asymptotically good time-varying codes

AU - Justesen, Jørn

N1 - Copyright 1973 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 - 1973

Y1 - 1973

N2 - We show that the generator polynomials of certain cyclic codes define noncatastrophic fixed convolutional codes whose free distances are lowerbounded by the minimum distances of the cyclic codes. This result is used to construct convolutioual codes with free distance equal to the constraint length and to derive convolutional codes with good free distances from the BCH codes. Finally, a class of time-varying codes is constructed for which the free distance increases linearly with the constraint length.

AB - We show that the generator polynomials of certain cyclic codes define noncatastrophic fixed convolutional codes whose free distances are lowerbounded by the minimum distances of the cyclic codes. This result is used to construct convolutioual codes with free distance equal to the constraint length and to derive convolutional codes with good free distances from the BCH codes. Finally, a class of time-varying codes is constructed for which the free distance increases linearly with the constraint length.

M3 - Journal article

SN - 0018-9448

VL - 19

SP - 220

EP - 225

JO - I E E E Transactions on Information Theory

JF - I E E E Transactions on Information Theory

IS - 2

ER -

New convolutional code constructions and a class of asymptotically good time-varying codes

Abstract

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this