Title :
X-code: MDS array codes with optimal encoding
Author :
Xu, Lihao ; Bruck, Jehoshua
Author_Institution :
California Inst. of Technol., Pasadena, CA, USA
fDate :
1/1/1999 12:00:00 AM
Abstract :
We present a new class of MDS (maximum distance separable) array codes of size n×n (n a prime number) called X-code. The X-codes are of minimum column distance 3, namely, they can correct either one column error or two column erasures. The key novelty in X-code is that it has a simple geometrical construction which achieves encoding/update optimal complexity, i.e., a change of any single information bit affects exactly two parity bits. The key idea in our constructions is that all parity symbols are placed in rows rather than columns
Keywords :
computational complexity; error correction codes; MDS array codes; X-code; column erasures; column error; geometrical construction; maximum distance separable codes; optimal encoding; parity symbols; update optimal complexity; Decoding; Encoding; Error correction; NASA; Parity check codes; Space technology;
Journal_Title :
Information Theory, IEEE Transactions on