Unique Decoding of Explicit ε-balanced Codes Near the Gilbert-Varshamov Bound

by   Fernando Granha Jeronimo, et al.

The Gilbert-Varshamov bound (non-constructively) establishes the existence of binary codes of distance 1/2 -ϵ and rate Ω(ϵ^2) (where an upper bound of O(ϵ^2log(1/ϵ)) is known). Ta-Shma [STOC 2017] gave an explicit construction of ϵ-balanced binary codes, where any two distinct codewords are at a distance between 1/2 -ϵ/2 and 1/2+ϵ/2, achieving a near optimal rate of Ω(ϵ^2+β), where β→ 0 as ϵ→ 0. We develop unique and list decoding algorithms for (essentially) the family of codes constructed by Ta-Shma. We prove the following results for ϵ-balanced codes with block length N and rate Ω(ϵ^2+β) in this family: - For all ϵ, β > 0 there are explicit codes which can be uniquely decoded up to an error of half the minimum distance in time N^O_ϵ, β(1). - For any fixed constant β independent of ϵ, there is an explicit construction of codes which can be uniquely decoded up to an error of half the minimum distance in time (log(1/ϵ))^O(1)· N^O_β(1). - For any ϵ > 0, there are explicit ϵ-balanced codes with rate Ω(ϵ^2+β) which can be list decoded up to error 1/2 - ϵ' in time N^O_ϵ,ϵ',β(1), where ϵ', β→ 0 as ϵ→ 0. The starting point of our algorithms is the list decoding framework from Alev et al. [SODA 2020], which uses the Sum-of-Squares SDP hierarchy. The rates obtained there were quasipolynomial in ϵ. Here, we show how to overcome the far from optimal rates of this framework obtaining unique decoding algorithms for explicit binary codes of near optimal rate. These codes are based on simple modifications of Ta-Shma's construction.



There are no comments yet.


page 1

page 2

page 3

page 4


On the List Decodability of Insertions and Deletions

List decoding of insertions and deletions is studied. A Johnson-type upp...

Lattice (List) Decoding Near Minkowski's Inequality

Minkowski proved that any n-dimensional lattice of unit determinant has ...

Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes

It was shown in GXY18 that the length n of a q-ary linear locally recove...

List Decoding of Insertion and Deletion Codes

Insertion and deletion (Insdel for short) errors are synchronization err...

Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity

We identify a family of binary codes whose structure is similar to Reed-...

Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes

We give a simple proof that the (approximate, decisional) Shortest Vecto...

List Decoding with Double Samplers

We develop the notion of "double samplers", first introduced by Dinur an...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.