Conference paper
A family of efficient burst-correcting array codes
M. Blaum
ISIT 1990
The authors present a family of codes that can correct two-dimensional clusters of errors of size b1× b2using simple parity-check codes. The new codes are n1× n2array codes, where n1≥2b1b2-b1,n2≥2b1b2,b1divides n1and b2divides n2. Simple encoding and decoding algorithms are presented. © 1994, IEE. All rights reserved.
M. Blaum
ISIT 1990
M. Blaum, J. Bruck
ISIT 1998
L.J. García Villalba, J.R. Fuentes Cortez, et al.
IEEE Communications Letters
J. Bruck, M. Blaum
FTCS 1989