The List Decoding Radius of Reed-Muller Codes over Small Fields

DOI10.1145/2746539.2746543zbMath1321.94120arXiv1407.3433OpenAlexW2083259457MaRDI QIDQ2941515

Abhishek Bhowmick, Shachar Lovett

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.3433

zbMATH Keywords

weight distributioncoding theoryhigher-order Fourier analysisweak regularitylow-degree polynomialslist-decoding algorithmSchwartz-Zippel extensions

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (2)

The analytic rank of tensors and its applications ⋮ Unnamed Item

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: The List Decoding Radius of Reed-Muller Codes over Small Fields