A lower bound for burst error correcting capability of low rate binary cyclic codes

Sina Vafi, Narges Rezvani Majid

    Research output: Contribution to journalArticle

    Abstract

    The letter presents a lower bound for burst error correcting capability of a class of binary cyclic codes based on the structure of parity check polynomial and the properties of its circulant matrix. This bound is applied for implementation of an algorithm, which exactly determines codes' error correcting capabilities. The algorithm has less complexity than other ones and is applicable for codes with a large number of parity bits.
    Original languageEnglish
    Pages (from-to)33-36
    Number of pages4
    JournalIEEE Communications Letters
    Volume20
    Issue number1
    DOIs
    Publication statusPublished - Jan 2016

    Fingerprint Dive into the research topics of 'A lower bound for burst error correcting capability of low rate binary cyclic codes'. Together they form a unique fingerprint.

    Cite this