Abstract
Etzion [T. Etzion, Perfect byte correcting codes, IEEE Trans. Inform. Theory 44 (1998) 3140–3146.] has classified byte error correcting binary codes into five different categories with respect to the size of the byte. If a code is partitioned into [Formula: see text] equal byte of size say [Formula: see text] then [Formula: see text] or the size of bytes is [Formula: see text]. Alternatively if bytes are of different size say, [Formula: see text] then [Formula: see text]. The result was further modified by Tyagi and Sethi [V. Tyagi and A. Sethi, [Formula: see text]-Byte correcting perfect codes, Asian-Eur. J. Math. 7(1) (2014) 1–8.] and the classification of bytes was given with respect to size of the byte as well as length of the burst. We call such codes as [Formula: see text]-byte correcting perfect codes. Our aim in this paper is to find the possibilities for the existence of [Formula: see text]-byte correcting non-binary perfect codes.
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.
