We introduce a family of binary array codes of size t × n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e. being considered as codes over GF(2t) they are MDS. The length of the codes is n = ∑l=1L (lt), where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL, where r is the number of correctable erasures, and m is the smallest number such that 2t = 1 modulo m. This compares favorably with the complexity of decoding codes obtained from the shortened general Reed-Solomon codes having the same parameters.
|Number of pages
|Published - 1996
|Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr
Duration: 5 Nov 1996 → 6 Nov 1996
|Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel
|5/11/96 → 6/11/96