Abstract

In (Adbel-Ghaffar et al., 1986) it is shown that for each integer b⩾1 infinitely many optimum cyclic b-burst correcting codes exist. In the first part of this correspondence the parameters of all optimum cyclic four- and five-burst-correcting codes are given explicitly. Tables are included. In (van Tilborg, 1993) a very brief indication of the decoding of optimum cyclic burst-correcting codes is given. In the second part of this correspondence the decoding algorithm is analyzed in further detail. It turns out that the bulk of the decoding steps can be performed completely in parallel.

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 call

Disclaimer: 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.