On Pseudolinear Codes for Correcting Adversarial Errors

by   Eric Ruzomberka, et al.

We consider error-correction coding schemes for adversarial wiretap channels (AWTCs) in which the channel can a) read a fraction of the codeword bits up to a bound r and b) flip a fraction of the bits up to a bound p. The channel can freely choose the locations of the bit reads and bit flips via a process with unbounded computational power. Codes for the AWTC are of broad interest in the area of information security, as they can provide data resiliency in settings where an attacker has limited access to a storage or transmission medium. We investigate a family of non-linear codes known as pseudolinear codes, which were first proposed by Guruswami and Indyk (FOCS 2001) for constructing list-decodable codes independent of the AWTC setting. Unlike general non-linear codes, pseudolinear codes admit efficient encoders and have succinct representations. We focus on unique decoding and show that random pseudolinear codes can achieve rates up to the binary symmetric channel (BSC) capacity 1-H_2(p) for any p,r in the less noisy region: p<1/2 and r<1-H_2(p) where H_2(·) is the binary entropy function. Thus, pseudolinear codes are the first known optimal-rate binary code family for the less noisy AWTC that admit efficient encoders. The above result can be viewed as a derandomization result of random general codes in the AWTC setting, which in turn opens new avenues for applying derandomization techniques to randomized constructions of AWTC codes. Our proof applies a novel concentration inequality for sums of random variables with limited independence which may be of interest as an analysis tool more generally.


page 1

page 2

page 3

page 4


Derandomizing Codes for the Binary Adversarial Wiretap Channel of Type II

We revisit the binary adversarial wiretap channel (AWTC) of type II in w...

Optimal list decoding from noisy entropy inequality

A noisy entropy inequality for boolean functions by Samorodnitsky is app...

Reed-Muller Codes Achieve Capacity on BMS Channels

This paper considers the performance of long Reed-Muller (RM) codes tran...

Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel

This work gives an explicit construction of a family of error correcting...

Robust Non-Linear Feedback Coding via Power-Constrained Deep Learning

The design of codes for feedback-enabled communications has been a long-...

On Low Density Majority Codes

We study a problem of constructing codes that transform a channel with h...

Low density majority codes and the problem of graceful degradation

We study a problem of constructing codes that transform a channel with h...

Please sign up or login with your details

Forgot password? Click here to reset