A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes

DOI10.1007/978-3-642-32512-0_54zbMath1366.68362arXiv1204.5467OpenAlexW3037701641MaRDI QIDQ3167433

Noga Ron-Zewi

Publication date: 2 November 2012

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Randomized algorithms (68W20)

Related Items (1)

Identifying Generalized Reed-Muller Codewords by Quantum Queries

This page was built for publication: A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes