Shannon Rate Seeded Codes from Indistinguishability ObfuscationResearch Paper
A sender encodes a message into a codeword of length , and a channel may flip up to bits. If the bits are flipped independently at random (Shannon's model), efficient codes reach the Shannon capacity for every , where is the binary entropy function in bits. If the channel chooses the error pattern adversarially (Hamming's…