On the Existence of Optimum Cyclic Burst-Correcting Codes

Khaled A.S. Abdel-Ghaffar, Robert J. McEliece, Andrew M. Odlyzko, Henk C.A. van Tilborg

Research output: Contribution to journalArticlepeer-review

28 Scopus citations


It is shown that for each integer b ≥ 1 infinitely many optimum cyclic b-burst-correcting codes exist, i.e., codes whose length n, redundancy r, and burst-correcting capability b, satisfy n = 2r−b+1 − 1. Some optimum codes for b = 3, 4, and 5 are also studied in detail.

Original languageEnglish (US)
Pages (from-to)768-775
Number of pages8
JournalIEEE Transactions on Information Theory
Issue number6
StatePublished - Nov 1986


Dive into the research topics of 'On the Existence of Optimum Cyclic Burst-Correcting Codes'. Together they form a unique fingerprint.

Cite this