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

Jørn Justesen

    Research output: Contribution to journalJournal articleResearchpeer-review

    329 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 languageEnglish
    JournalI E E E Transactions on Information Theory
    Volume19
    Issue number2
    Pages (from-to)220-225
    ISSN0018-9448
    Publication statusPublished - 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.

    Fingerprint Dive into the research topics of 'New convolutional code constructions and a class of asymptotically good time-varying codes'. Together they form a unique fingerprint.

    Cite this