Multiple-burst error-correcting cyclic product codes (Corresp.)

Author

Van Overveld, W. M C J

Volume

Issue

fYear

1987

fDate

11/1/1987 12:00:00 AM

Firstpage

919

Lastpage

923

Abstract

Let $C$ be the cyclic product code of $p$ single parity check codes of relatively prime lengths $n_{1}, n_{2},\\cdots , n_{p} (n_{1} < n_{2} < \\cdots < n_{p})$ . It is proven that $C$ can correct $2^{P-2}+2^{p-3}-1$ bursts of length $n_{1}$ , and $\\lfloor (\\max {p+1, \\min{2^{p-s}+s-1,2^{p-s}+2^{p-s-1}}}-1)/2\\rfloor$ bursts of length $n_{1}n_{2} \\cdots n_{s} (2\\leq s \\leq p-2)$ . For $p=3$ this means that $C$ is double-burst- $n_{1}$ -correcting. An efficient decoding algorithm is presented for this code.

Keywords

Burst-correction coding; Cyclic coding; Product coding; Block codes; Informatics; Linear code; Notice of Violation; Parity check codes; Product codes;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.1987.1057364

Filename

1057364

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=943501