Abstract
There are several kinds of burst errors for which error detecting and error correcting codes have been constructed. In this paper, we consider a new kind of burst error which will be termed as ‘m-repeated burst error of length b(fixed)’. The paper presents lower bounds on the number of parity-check digits required for a linear code that is capable of detecting errors which are m-repeated burst errors of length b(fixed). Further, codes capable of detecting and simultaneously correcting such errors have also been studied.
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.
