Conference paper
COUNTERFACTUAL CONCEPT BOTTLENECK MODELS
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025
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.
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
M.F. Cowlishaw
IBM Systems Journal