Oliver Bodemer
IBM J. Res. Dev
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.
Oliver Bodemer
IBM J. Res. Dev
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering