DocumentCode :
2664495
Title :
Generating Burst-Error Correcting Codes from Orthogonal Latin Square Codes -- A Graph Theoretic Approach
Author :
Datta, Rudrajit ; Touba, Nur A.
Author_Institution :
Comput. Eng. Res. Center, Univ. of Texas at Austin, Austin, TX, USA
fYear :
2011
fDate :
3-5 Oct. 2011
Firstpage :
367
Lastpage :
373
Abstract :
The paper proposes a scheme by which an Orthogonal Latin Square code (OLS) can be modified to correct burst-errors of specific length. The method discussed in this paper models it as a graph coloring problem where the goal is to resolve conflicts in the existing OLS code in order for it to correct burst-errors. Conflicts are resolved by reordering and/or reorganizing existing parity relations by inclusion of extra check bits. The graph coloring approach tries to minimize the number of additional check bits required. The final OLS code after reordering and/or reorganizing would be capable of correcting burst-errors of specific length in addition to its original error correction capabilities.
Keywords :
error correction codes; graph theory; orthogonal codes; OLS code; burst-error correcting codes; graph coloring problem; graph theoretic approach; orthogonal latin square codes; Arrays; Color; Decoding; Error correction codes; Flash memory; Image color analysis; Parity check codes; Orthogonal Latin Square; burst error; graph coloring;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT), 2011 IEEE International Symposium on
Conference_Location :
Vancouver, BC
Print_ISBN :
978-1-4577-1713-0
Type :
conf
DOI :
10.1109/DFT.2011.3
Filename :
6104464
Link To Document :
بازگشت