Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
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.
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Raymond Wu, Jie Lu
ITA Conference 2007
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001