TY - GEN
T1 - Update efficient codes for error correction
AU - Mazumdar, Arya
AU - Wornell, Gregory W.
AU - Chandar, Venkat
PY - 2012
Y1 - 2012
N2 - An update efficient code is a mapping from messages to codewords such that small perturbations in the message induce only slight changes to the corresponding codeword. The parameter that captures this notion is called update-efficiency. In this paper we study update-efficient error-correcting codes and develop their basic properties. While update-efficiency and error-correction are two conflicting objectives, we deduce conditions for existence of such codes. In particular, logarithmically growing update-efficiency is achievable with a capacity-achieving linear code in both binary symmetric and binary erasure channels. On the other hand we show a tight converse result. Our result implies that it is not possible to have a capacity-achieving code in binary symmetric channel that has sub-logarithmic update-efficiency. This is true in the case of the binary erasure channel as well for linear codes. We also discuss a number of questions related to update-efficient adversarial error-correcting codes.
AB - An update efficient code is a mapping from messages to codewords such that small perturbations in the message induce only slight changes to the corresponding codeword. The parameter that captures this notion is called update-efficiency. In this paper we study update-efficient error-correcting codes and develop their basic properties. While update-efficiency and error-correction are two conflicting objectives, we deduce conditions for existence of such codes. In particular, logarithmically growing update-efficiency is achievable with a capacity-achieving linear code in both binary symmetric and binary erasure channels. On the other hand we show a tight converse result. Our result implies that it is not possible to have a capacity-achieving code in binary symmetric channel that has sub-logarithmic update-efficiency. This is true in the case of the binary erasure channel as well for linear codes. We also discuss a number of questions related to update-efficient adversarial error-correcting codes.
UR - http://www.scopus.com/inward/record.url?scp=84867544012&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867544012&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2012.6283534
DO - 10.1109/ISIT.2012.6283534
M3 - Conference contribution
AN - SCOPUS:84867544012
SN - 9781467325790
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1558
EP - 1562
BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012
Y2 - 1 July 2012 through 6 July 2012
ER -