Abstract
In this correspondence, we show how to generate bi-byte correcting perfect codes, i > 0 organized in m bytes of size β, n = mβ, and present necessary and sufficient conditions for their existence. By a bi-byte correcting perfect codes we mean a code that corrects burst of size b1 in the first byte, burst of length b2 in the second byte and so on, burst of length bm in the mth byte.
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.
