Abstract
The letter presents a lower bound for burst error correcting capability of a class of binary cyclic codes based on the structure of parity check polynomial and the properties of its circulant matrix. This bound is applied for implementation of an algorithm, which exactly determines codes’ error correcting capabilities. The algorithm has less complexity than other ones and is applicable for codes with a large number of parity bits.
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.
