Null boundary 90/150 cellular automata for multi-byte error correcting code

  • Authors:
  • Jaydeb Bhaumik;Dipanwita Roy Chowdhury;Indrajit Chakrabarti

  • Affiliations:
  • Indian Institute of Technology, Kharagpur, India;Indian Institute of Technology, Kharagpur, India;Indian Institute of Technology, Kharagpur, India

  • Venue:
  • ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cellular Automata(CA) is a well known tool to generate byte error correcting code. In this paper, we propose a CA-based multibyte Error Correcting Code (ECC) which overcomes the weaknesses and limitation of existing scheme. As a case study three and four bytes ECC are discussed in detailed. A complete decoding algorithm of CAbased 3-byte error correcting code is presented in this work. Proposed 3-byte ECC scheme can correct errors when errors are distributed within information and check bytes or concentrated in any one of them. In case of CA-based 4-byte ECC, at most 4-byte errors can be corrected if all the errors are concentrated in information or check bytes.