S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
The usual (k2 + 1) × (k1 + 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 (k2 + 1) × (k1 + 1) array code with diagonal readout can correct any burst of length up to k1 if and only if k2 ≥ 2(k1 − 1). Copyright © 1986 by The Institute of Electrical and Electronics Engineers, Inc.
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
David S. Kung
DAC 1998
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002