Skip to main content
SpringerLink
Log in

Error Correcting Codes via Reversible Cellular Automata Over Finite Fields

  • Research Article - Computer Engineering and Computer Science
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

Cellular automata-based bit error correcting codes over binary field was originally studied by Chowdhury et al. (IEEE Trans. Comput. 43:759–764, 1994) and also an algorithm for decoding such codes was introduced. Further, for the binary field case, it was shown that cellular automata-based error correcting codes have faster decoding algorithm than the classical linear syndrome decoding algorithm. We generalize Chowdhury’s approach from binary to primitive finite fields and we also compare the classical syndrome decoding with the one introduced in this work. We show that error correcting codes obtained via cellular automata have faster decoding than the classical ones.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chowdhury D.R., Basu S., Gupta I.S., Chaudhuri P.P.: Design of CAECC Cellular Automata Based Error Correcting Code. IEEE Trans. Comput. 43, 759–764 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chaudhuri, P.P.; Choudhury, D.R.; Nandi, S.; Chattopadhyay, S.: Additive cellular Aautomata theory and applications, vol. 1. IEEE Computer Society Press, Los Alamitos (1997)

  3. Betten, A.A.; Braun, M.; Kerber, A.; Kohnert, A.; Wassermann, A: Error correcting linear codes: classification by isometry and application. Springer, Berlin/Heidelberg/New York (2006)

  4. Cho S.J., Kim H., Pyo Y., Park Y., Hwang Y., Choi U., Heo S.: Single error correcting code using PBCA. J. Appl. Math. Comput. 14, 461–471 (2004)

    Article  Google Scholar 

  5. Cho, S.J.; Choi, U.; Heo, S.: Design of double error correcting codes based on cellular automata. J. Appl. Math. Comput. 21, 545–553 (2006)

    Google Scholar 

  6. Siap, I.; Akin, H.; Uguz, S.: Structure and reversibility of two dimensional hexagonal cellular automata. Comput. Math. Appl. 62(11), 4161–4169 (2011)

    Google Scholar 

  7. Cinkir, Z.; Akin, H.; Siap, I.: Reversibility of 1D cellular Automata with periodic boundary over finite fields Z p . J. Stat. Phys. 143 (4), 807–823 (2011)

    Google Scholar 

  8. Akin H., Sah F., Siap I.: On 1D reversible cellular automata with reflective boundary over the prime field of order p. Int. J. Modern Phys. C. 23(1), 1–13 (2012)

    Article  MathSciNet  Google Scholar 

  9. Cattell, K.; Muzio, J.C.: Analysis of one-dimensional linear hybrid cellular automata over GF(q). IEEE Trans. Comput. 45(7), 782–792 (1996)

    Google Scholar 

  10. Cho, S.J.; Kim, H.; Choi, U.: Analysis of one-dimensional cellular automata over GF(q). J. KSIAM. 4 (2), 21–32 (2000)

    Google Scholar 

  11. Moon T.K.: Error Correction Coding Mathematical Methods and Algorithms. A John Wiley, New Jersey (2005)

    Book  Google Scholar 

  12. Zaragoza, R.H.: The Art of Error Correcting Codes. Wiley & Sons, Inc., Hoboken (2006)

  13. von Neumann, J.: Theory of Self-Reproducing Automata (edited by A. W. Burks). University of Illinois Press, Urbana/London (1966)

  14. Schiff, J.L.: Cellular Automata: A Discrete View of the World Wiley & Sons, Inc., Hoboken (2008)

  15. Das, A.K.; Ganguly, A.; Dasgupta, A.; Bhawmik, S.; Chaudhuri, P.P.: Efficient characterization of cellular automata. IEE Proc. Part E. Comput. Digit. Tech. 137(1), 81–87 (1990)

    Google Scholar 

  16. Roy Chowdhury, D.; Subbarao, P.; Chaudhuri, P.P.: Characterization of two-dimensional cellular automata using matrix algebra. Inform. Sci. 71, 289–314 (1993)

    Google Scholar 

  17. Siap I., Akin H., Sah F.: Characterization of two-dimensional cellular automata over ternary fields. J Frankl. Inst. 348((7), 1258–1275 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  18. Encinas, L.H.; del Rey, A.M.: Inverse rules of ECA with rule number 150. Appl. Math. Comput. 189, 1782–1786 (2007)

    Google Scholar 

  19. Seck, J.C.; Juarez, G.; McIntosh, H.V.: The inverse behaviour of a reversible one-dimensional cellular automation obtained by a single Welch diagram. J. Cell. Automata. 1, 25–39 (2006)

    Google Scholar 

  20. Paul, K.; Chowdhury, D.R.: Application of GF(2p) CA in burst error correcting codes. In: Proceedings of VLSI00, India. pp. 562–567 (2000)

  21. MacWilliams F.J., Sloane N.J.A.: The theory of error-correcting codes. Elsevier, North-Holland (1977)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Graduate School, Yildiz Technical University, Istanbul, Turkey

    Mehmet E. Koroglu

  2. Department of Mathematics, Yildiz Technical University, 34210, Esenler, Istanbul, Turkey

    Irfan Siap

  3. Department of Mathematics, Faculty of Education, Zirve University, 27260, Gaziantep, Turkey

    Hasan Akın

Authors
  1. Mehmet E. Koroglu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Irfan Siap
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hasan Akın
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hasan Akın.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koroglu, M.E., Siap, I. & Akın, H. Error Correcting Codes via Reversible Cellular Automata Over Finite Fields. Arab J Sci Eng 39, 1881–1887 (2014). https://doi.org/10.1007/s13369-013-0757-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-013-0757-0

Keywords

Search

Navigation