TY - JOUR
T1 - On the Existence of Optimum Cyclic Burst-Correcting Codes
AU - Abdel-Ghaffar, Khaled A.S.
AU - McEliece, Robert J.
AU - Odlyzko, Andrew M.
AU - van Tilborg, Henk C.A.
PY - 1986/11
Y1 - 1986/11
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0022811644&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0022811644&partnerID=8YFLogxK
U2 - 10.1109/TIT.1986.1057242
DO - 10.1109/TIT.1986.1057242
M3 - Article
AN - SCOPUS:0022811644
SN - 0018-9448
VL - 32
SP - 768
EP - 775
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 6
ER -