Upper bounds on the number of errors corrected by a convolutional code

Jørn Justesen

    Research output: Contribution to journalJournal articleResearchpeer-review

    529 Downloads (Pure)

    Abstract

    We derive upper bounds on the weights of error patterns that can be corrected by a convolutional code with given parameters, or equivalently we give bounds on the code rate for a given set of error patterns. The bounds parallel the Hamming bound for block codes by relating the number of error patterns to the number of distinct syndromes.
    Original languageEnglish
    JournalI E E E Transactions on Information Theory
    Volume50
    Issue number2
    Pages (from-to)350 - 353
    ISSN0018-9448
    DOIs
    Publication statusPublished - 2004

    Bibliographical note

    Copyright: 2004 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 'Upper bounds on the number of errors corrected by a convolutional code'. Together they form a unique fingerprint.

    Cite this