Optimal list decoding from noisy entropy inequality
Information Theory
2022-12-06 v1 Combinatorics
math.IT
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).
Keywords
Cite
@article{arxiv.2212.01443,
title = {Optimal list decoding from noisy entropy inequality},
author = {Jan Hązła},
journal= {arXiv preprint arXiv:2212.01443},
year = {2022}
}
Comments
Comments welcome