List Decoding, Linear Hashing, and Furstenberg over Research Paper
A linear code is a subspace . It is -list decodable if every Hamming ball of radius contains at most codewords: a receiver that sees a word with at most a fraction of corrupted symbols can narrow the sent codeword down to a list of at most candidates. The list decoding capacity theorem says that codes of rate …