DeepAI AI Chat
Log In Sign Up

Optimal list decoding from noisy entropy inequality

12/02/2022
by   Jan Hązła, et al.
0

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).

READ FULL TEXT

page 1

page 2

page 3

page 4

02/01/2022

On List Decoding Transitive Codes From Random Errors

We study the error resilience of transitive linear codes over 𝔽_2. We gi...
11/18/2019

Finding Skewed Subcubes Under a Distribution

Say that we are given samples from a distribution ψ over an n-dimensiona...
07/07/2023

On Pseudolinear Codes for Correcting Adversarial Errors

We consider error-correction coding schemes for adversarial wiretap chan...
10/20/2020

A New Rearrangement Inequality and Its Application to Index Assignment

This paper investigates the rearrangement problem whose objective is to ...
10/18/2018

Ratio List Decoding

We extend the notion of list decoding to ratio list decoding which invo...
10/03/2021

Binary code optimization

This article shows that any type of binary data can be defined as a coll...
11/29/2018

Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding

This paper studies the joint design of optimal convolutional codes (CCs)...