Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate
Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate
In this paper, we consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter p and (b) the process which adds the errors can be described by a sufficiently …