bi-Byte correcting non-binary perfect codes-Reference-Cited by-同舟云学术

bi-Byte correcting non-binary perfect codes

Published:2019-04 Issue:02 Volume:11 Page:1950018
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Tyagi Vinod¹,Lata Tarun²^ORCID

Affiliation:

1. Department of Mathematics, Shyam Lal College (Evening), University of Delhi, Delhi 110032, India

2. Department of Mathematics, University of Delhi, Delhi 110007, India

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830919500186

Reference11 articles.

1. A class of systematic codes for non-independent errors

2. Error-Correcting Codes with Byte Error-Detection Capability

3. Byte-Oriented Error-Correcting Codes for Semiconductor Memory Systems

4. Perfect byte-correcting codes

5. Constructions for perfect 2-burst-correcting codes