论文标题
噪音熵不平等的最佳列表解码
Optimal list decoding from noisy entropy inequality
论文作者
论文摘要
Samorodnitsky对布尔功能的嘈杂熵不等式应用于二元代码。结果表明,在二进制擦除通道上实现容量的二进制代码允许在某些二进制对称频道上解码列表的最佳列表大小(在此最佳列表大小呈指数呈呈成倍的列表大小的制度中)。
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).