Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 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.
Michael D. Moffitt
ICCAD 2009
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Preeti Malakar, Thomas George, et al.
SC 2012
Raymond Wu, Jie Lu
ITA Conference 2007