11 Linear-Time Codes for Unique Decoding
The goal of this chapter is also to construct codes which can be decoded from a large, and essentially up to a “maximum” possible, fraction of errors, with a near-optimal trade-off between rate and error-correction radius. The difference is that we are now interested in unique decoding as opposed to list decoding.
Unable to display preview. Download preview PDF.