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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
