Title :
New pattern erasure codes
Author :
Sheng Lin ; Kai Shi ; Stones, Douglas S. ; Guangping Xu ; Jinsong Wang
Author_Institution :
Sch. of Comput. & Commun. of Eng., Tianjin Univ. of Technol., Tianjin, China
Abstract :
In this paper, we study binary pattern erasure codes, i.e., binary codes that are resiliant to erasures from a family P of possible erasures. We give an algorithmic proof of the existence of a binary linear code with codewords of length n that is resiliant to erasures from P when P satisfies the properties: every pattern p ϵ P has size m and every letter in the alphabet occurs in at most c patterns. The density of the parity matrix is plays a important role in storage applications, so we also introduce a new low density code basing on graph theory.
Keywords :
graph theory; linear codes; binary linear code; binary pattern erasure codes; codewords; family P; graph theory; low density code; parity matrix; storage applications; Arrays; Educational institutions; Matrix decomposition; Null space; Parity check codes; Vectors;
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
DOI :
10.1109/ISIT.2013.6620556