G. Ramalingam
Theoretical Computer Science
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.
G. Ramalingam
Theoretical Computer Science
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007