SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Achieving the empirical capacity using feedback: memoryless additive models
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Optimal error correction for computationally bounded noise
IEEE Transactions on Information Theory
Optimal error correction against computationally bounded noise
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Private locally decodable codes
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.18 |
Coding theory adresses the design and analysis of codes that enable communication over noisy channels. Two types of channels that have been extensively considered are the binary symmetric channel and the adversarial channel. In a binary symmetric channel each bit of the sent message is flipped independently with some probability p, implying that the noise imposed by the channel is random in nature where the amount of noise is determined by p. In an adversarial channel the message is treated as a whole, and the noise may be an arbitray (and malicious) function of the message being sent, as long as it does not effect more than a certain fraction (say p) of the bits transmitted. Roughly speaking, any code designed for an adversarial channel can be used on a corresponding binary symmetric channel successsfully, whereas the contrary is not necessarily true. In this work we will present a construction that transforms the best codes for binary symmetric channels into "codes" for corresponding adversarial channels. The "codes" we present assume that the sender and the receiver of the message have a joint secret random string (which is not known to the channel). These codes are referred to as private codes. Intuitively, this private randomness allows a reduction between the random and adversarial channels. Such a reduction is simple once the size of the joint random string 驴(n log n) (here the codes are a subset of {0, 1}^(n)). In this work we present private codes in which the size of the joint random string is 0(log n). Moreover, we show that our result is tight. Namely, to design private codes that allow communication over adversarial channels that meet the bounds achievable when communicating over binary symmetric channels, an amount of 驴(log n) shared random bits are required. To the best of our knowledge, no prior results of this nature have been presented in the past. As part of our proof we established a connection between list decodable codes and private codes which complements a recent result of Guruswami (CCC'03) on list decoding with side information.