Optimal list decoding from noisy entropy inequality
From MaRDI portal
Abstract: A noisy entropy inequality for boolean functions by Samorodnitsky is applied to binary codes. It is shown that a binary code that achieves capacity on the binary erasure channel admits optimal list size for list decoding on some binary symmetric channels (in a regime where this optimal list size is exponentially large).
This page was built for publication: Optimal list decoding from noisy entropy inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419382)
