Comments on 'An efficient algorithm for computing free distance' by Bahl, L., et al.

    Research output: Contribution to journalJournal articleResearchpeer-review

    273 Downloads (Pure)

    Abstract

    In the above paper,^1Bahl et aL described a bidirectional search algorithm for computing the free distance of convolutional codes. There are some flaws in that algorithm. This correspondence contains a corrected version of the algorithm together with a proof that the corrected version always computes the free distance for noncatastrophic codes.
    Original languageEnglish
    JournalI E E E Transactions on Information Theory
    Volume19
    Issue number4
    Pages (from-to)577-579
    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.

    Cite this