(b1, b2)-Optimal Byte Correcting Codes

Vinod Tyagi; Amita Sethi

doi:https://doi.org/10.14445/22315373/IJMTT-V46P507

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 46 | Number 1 | Year 2017 | Article Id. IJMTT-V46P507 | DOI : https://doi.org/10.14445/22315373/IJMTT-V46P507

(b1, b2)-Optimal Byte Correcting Codes

Vinod Tyagi, Amita Sethi

Abstract

In this correspondence, we show how to generate optimal binary linear codes organized in bytes which can correct a fixed burst of length 1b(fixed) in one byte and burst of length 2b(fixed) in the remaining bytes.

Keywords

Optimal codes, Byte organized memory, syndromes, burst of length b (fixed), parity check matrix.

References

[1] B.K. Dass (1980), On a burst error correcting code, J. Inf. Optimiz. Sci., Vol. 1, No. 3, pp. 291-295.
[2] C.L. Chen (1983), Error correcting codes with byte error detection capabilities, IEEE Trans. Comput., Vol. C-32, pp. 615-621.
[3] C.L. Chen (1986), Byte oriented error correcting codes with semiconductor memory systems, IEEE Trans. Comput., Vol. C-35, pp. 646-648.
[4] R.T. Chien and D.T. Tang (July 1965), On definition of a burst, IBM J. Res. Develop., Vol. 9, pp. 292-293.
[5] T.R.N. Rao and E. Fujiwara (1989), Error Control Coding for computer System, Englewood Cliff, NJ: Prentice Hall.
[6] Tuvi Etzion(1998), Perfect byte correcting codes, IEEE Trans. Inform. Theory, Vol. 44, pp. 3140-3146.
[7] Vinod Tyagi and Amita Sethi (2007), 123123(,,)bbbnnn Linear Codes over GF(2), Beykent University Journal of Science and Technology, 3(2), 301-319.

Citation :

Vinod Tyagi, Amita Sethi, "(b1, b2)-Optimal Byte Correcting Codes," International Journal of Mathematics Trends and Technology (IJMTT), vol. 46, no. 1, pp. 34-36, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V46P507