scientific article
From MaRDI portal
Publication:3549710
zbMath1231.94068MaRDI QIDQ3549710
David Zuckerman, Adam R. Klivans, Parikshit Gopalan
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Can we locally compute sparse connected subgraphs? ⋮ List Decoding of Binary Codes–A Brief Survey of Some Recent Results ⋮ List-decoding Barnes-Wall lattices ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ⋮ On the Bias of Reed--Muller Codes over Odd Prime Fields ⋮ Random low-degree polynomials are hard to approximate ⋮ Group homomorphisms as error correcting codes ⋮ Some Recent Results on Local Testing of Sparse Linear Codes
