A class of burst-correcting array codes

M. Blaum; P.G. Farrell; H.C.A. Tilborg, van

doi:10.1109/TIT.1986.1057234

A class of burst-correcting array codes

M. Blaum, P.G. Farrell, H.C.A. Tilborg, van

Discrete Mathematics

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

16 Citaten (Scopus)

2 Downloads (Pure)

Samenvatting

The usual (k_{2} + 1) times (k_{1} + 1) array code, in which the last row and the last column contain redundant bits, can correct any single error. However, if the bits are read diagonally instead of horizontally, the code can correct bursts of errors. It is shown that the(_{k}2 + 1) times (k_{1} + 1)array code with diagonal readout can correct any burst of length up tok_{1}if and only ifk_{2} geq 2(k_{1} - 1).

Originele taal-2	Engels
Pagina's (van-tot)	836-839
Aantal pagina's	4
Tijdschrift	IEEE Transactions on Information Theory
Volume	32
Nummer van het tijdschrift	6
DOI's	https://doi.org/10.1109/TIT.1986.1057234
Status	Gepubliceerd - 1986

Toegang tot document

10.1109/TIT.1986.1057234

Vingerafdruk Duik in de onderzoeksthema's van 'A class of burst-correcting array codes'. Samen vormen ze een unieke vingerafdruk.

Citeer dit

@article{06b5791d8d8e4174acedcd64ba95b019,

title = "A class of burst-correcting array codes",

abstract = "The usual (k_{2} + 1) times (k_{1} + 1) array code, in which the last row and the last column contain redundant bits, can correct any single error. However, if the bits are read diagonally instead of horizontally, the code can correct bursts of errors. It is shown that the(_{k}2 + 1) times (k_{1} + 1)array code with diagonal readout can correct any burst of length up tok_{1}if and only ifk_{2} geq 2(k_{1} - 1).",

author = "M. Blaum and P.G. Farrell and {Tilborg, van}, H.C.A.",

year = "1986",

doi = "10.1109/TIT.1986.1057234",

language = "English",

volume = "32",

pages = "836--839",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "6",

}

TY - JOUR

T1 - A class of burst-correcting array codes

AU - Blaum, M.

AU - Farrell, P.G.

AU - Tilborg, van, H.C.A.

PY - 1986

Y1 - 1986

N2 - The usual (k_{2} + 1) times (k_{1} + 1) array code, in which the last row and the last column contain redundant bits, can correct any single error. However, if the bits are read diagonally instead of horizontally, the code can correct bursts of errors. It is shown that the(_{k}2 + 1) times (k_{1} + 1)array code with diagonal readout can correct any burst of length up tok_{1}if and only ifk_{2} geq 2(k_{1} - 1).

AB - The usual (k_{2} + 1) times (k_{1} + 1) array code, in which the last row and the last column contain redundant bits, can correct any single error. However, if the bits are read diagonally instead of horizontally, the code can correct bursts of errors. It is shown that the(_{k}2 + 1) times (k_{1} + 1)array code with diagonal readout can correct any burst of length up tok_{1}if and only ifk_{2} geq 2(k_{1} - 1).

U2 - 10.1109/TIT.1986.1057234

DO - 10.1109/TIT.1986.1057234

M3 - Article

VL - 32

SP - 836

EP - 839

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -