Quasi-cyclic unit memory convolutional codes

Jørn Justesen, Erik Paaske, Mark Ballan

    Research output: Contribution to journalJournal articlepeer-review

    289 Downloads (Pure)

    Abstract

    Unit memory convolutional codes with generator matrices, which are composed of circulant submatrices, are introduced. This structure facilitates the analysis of efficient search for good codes. Equivalences among such codes and some of the basic structural properties are discussed. In particular, catastrophic encoders and minimal encoders are characterized and dual codes treated. Further, various distance measures are discussed, and a number of good codes, some of which result from efficient computer search and some of which result from known block codes, are presented
    Original languageEnglish
    JournalI E E E Transactions on Information Theory
    Volume36
    Issue number3
    Pages (from-to)540-547
    ISSN0018-9448
    DOIs
    Publication statusPublished - 1990

    Bibliographical note

    Copyright: 1990 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 'Quasi-cyclic unit memory convolutional codes'. Together they form a unique fingerprint.

    Cite this