Advertisement
Published in:
2010 | OriginalPaper | Chapter
Null Boundary 90/150 Cellular Automata for Multi-byte Error Correcting Code
Authors : Jaydeb Bhaumik, Dipanwita Roy Chowdhury, Indrajit Chakrabarti
Published in: Cellular Automata
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Cellular Automata(CA) is a well known tool to generate byte error correcting code. In this paper, we propose a CA-based multi-byte 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 CA-based 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.