Update efficient codes for error correction

Arya Mazumdar, Gregory W. Wornell, Venkat Chandar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages1558-1562
Number of pages5
DOIs
StatePublished - Oct 22 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: Jul 1 2012Jul 6 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA
Period7/1/127/6/12

Fingerprint

Dive into the research topics of 'Update efficient codes for error correction'. Together they form a unique fingerprint.

Cite this