Singleton-type bounds for list-decoding and list-recovery, and related results

12/10/2021
by   Eitan Goldberg, et al.
0

List-decoding and list-recovery are important generalizations of unique decoding that received considerable attention over the years. However, the optimal trade-off among list-decoding (resp. list-recovery) radius, list size, and the code rate are not fully understood in both problems. This paper takes a step towards this direction when the list size is a given constant and the alphabet size is large (as a function of the code length). We prove a new Singleton-type upper bound for list-decodable codes, which improves upon the previously known bound by roughly a factor of 1/L, where L is the list size. We also prove a Singleton-type upper bound for list-recoverable codes, which is to the best of our knowledge, the first such bound for list-recovery. We apply these results to obtain new lower bounds that are optimal up to a multiplicative constant on the list size for list-decodable and list-recoverable codes with rates approaching capacity. Moreover, we show that list-decodable nonlinear codes can strictly outperform list-decodable linear codes. More precisely, we show that there is a gap for a wide range of parameters, which grows fast with the alphabet size, between the size of the largest list-decodable nonlinear code and the size of the largest list-decodable linear codes. This is achieved by a novel connection between list-decoding and the notion of sparse hypergraphs in extremal combinatorics. We remark that such a gap is not known to exist in the problem of unique decoding. Lastly, we show that list-decodability or recoverability of codes implies in some sense good unique decodability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2018

On the List Decodability of Insertions and Deletions

List decoding of insertions and deletions is studied. A Johnson-type upp...
research
04/28/2020

Bounds for list-decoding and list-recovery of random linear codes

A family of error-correcting codes is list-decodable from error fraction...
research
05/04/2020

On the list recoverability of randomly punctured codes

We show that a random puncturing of a code with good distance is list re...
research
01/12/2019

List Decoding Random Euclidean Codes and Infinite Constellations

We study the list decodability of different ensembles of codes over the ...
research
02/23/2018

Synchronization Strings: List Decoding for Insertions and Deletions

We study codes that are list-decodable under insertions and deletions. S...
research
07/15/2011

From Small-World Networks to Comparison-Based Search

The problem of content search through comparisons has recently received ...
research
10/16/2018

List Decoding of Deletions Using Guess & Check Codes

Guess & Check (GC) codes are systematic binary codes that can correct mu...

Please sign up or login with your details

Forgot password? Click here to reset