List-Decoding with Double Samplers | Zendy

Irit Dinur | Zendy; Prahladh Harsha | Zendy; Tali Kaufman | Zendy; Inbal Navon | Zendy; Am TaShma | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

List-Decoding with Double Samplers

Author(s) -

Irit Dinur,

Prahladh Harsha,

Tali Kaufman,

Inbal Navon,

Am TaShma

Publication year - 2021

Publication title -

siam journal on computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.533

H-Index - 122

eISSN - 1095-7111

pISSN - 0097-5397

DOI - 10.1137/19m1276650

Subject(s) - decoding methods , expander graph , list decoding , computer science , subroutine , code (set theory) , algorithm , base (topology) , constraint (computer aided design) , tanner graph , discrete mathematics , mathematics , graph , theoretical computer science , concatenated error correction code , block code , programming language , mathematical analysis , geometry , set (abstract data type)

We strengthen the notion of double samplers, first introduced by Dinur and Kaufman [``High dimensional expanders imply agreement expanders,” in Proc. 58th IEEE Symp. on Foundations of Comp. Science...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research