On the Maximum Burst-Correcting Capability of Cyclic Hsu–Kasami–Chien Codes
Hsu–Kasami–Chien (HKC) are a class of cyclic codes that can correct either burst or random errors. This paper studies the maximum burst-correcting capability of HKC codes. A necessary and sufficient condition for a b- burst-correcting cyclic HKC code is given and simplified as a generalized one for Fire codes. An upper bound on the burstcorrecting capability of HKC codes is derived, which improves