Abstract
A class of quasi-cyclic multiple-burst-error-correcting codes are constructed in which threshold decoding is used. These codes resemble the interlaced self-orthogonal quasi-cyclic random-error-correcting codes constructed by Townsend and Weldon, but the interlacing depends on the parity-check equations used. These parity-check equations are based on difference triangles that were introduced by Robinson and Bernstein in connection with convolutional codes. A restriction on these codes is that the maximum error burst length allowable is a multiple of a subperiod n_o of the codes. It is shown that in many cases these codes have shorter length than the equivalent interlaced random-error-correcting quasi-cyclic codes.
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.
