Title :
Modified Low-Density MDS Array Codes
Author_Institution :
Super-Robust Comput. Project, Tokyo Univ.
Abstract :
In this paper we present a class of low-density MDS array codes that have sparsest parity-check matrices and fast encoding and erasure decoding algorithms. Proposed codes are a modification of the MDS array codes of Blaum et al. in 1996 and can be encoded and decoded by XOR operations with lower complexity than the MDS array codes of Feng et al. in 2005
Keywords :
decoding; matrix algebra; parity check codes; erasure decoding algorithms; low-density MDS array codes; parity-check matrices; Computational complexity; Decoding; Encoding; Galois fields; Internet; Length measurement; Multicast algorithms; Multicast protocols; Parity check codes; Reed-Solomon codes;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.261570
