Codes correcting phased burst erasures

Osnat Keren; Simon Litsyn

Codes correcting phased burst erasures

Osnat Keren
, Simon Litsyn

Tel Aviv University

Research output: Contribution to conference › Paper › peer-review

Abstract

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(2^t) they are MDS. The length of the codes is n = ∑_l=1^L (_l^t), 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 2^t = 1 modulo m. This compares favorably with the complexity of decoding codes obtained from the shortened general Reed-Solomon codes having the same parameters.

Original language	English
Pages	336-339
Number of pages	4
State	Published - 1996
Externally published	Yes
Event	Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr Duration: 5 Nov 1996 → 6 Nov 1996

Conference

Conference	Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel
City	Jerusalem, Isr
Period	5/11/96 → 6/11/96

Cite this

@conference{5b0336fa15bc45d2a0a5634a189367f1,

title = "Codes correcting phased burst erasures",

abstract = "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.",

author = "Osnat Keren and Simon Litsyn",

year = "1996",

language = "אנגלית",

pages = "336--339",

note = "Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel ; Conference date: 05-11-1996 Through 06-11-1996",

}

TY - CONF

T1 - Codes correcting phased burst erasures

AU - Keren, Osnat

AU - Litsyn, Simon

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0030402995

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0030402995

SP - 336

EP - 339

T2 - Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel

Y2 - 5 November 1996 through 6 November 1996

ER -

Codes correcting phased burst erasures

Abstract

Conference

Other files and links

Fingerprint

Cite this