Abstract
Hsu–Kasami–Chien (HKC) codes are a class of cyclic codes that can correct either burst or random errors. This letter 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 burst-correcting capability of HKC codes is derived, which improves upon a previous bound. Explicit examples of HKC codes are presented. A design guideline for constructing HKC codes with given burst-error and random-error correcting capabilities is presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
