A new upper bound on the query complexity for testing generalized Reed-Muller codes

Noga Ron-Zewi, Madhu Sudan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Fingerprint

Dive into the research topics of 'A new upper bound on the query complexity for testing generalized Reed-Muller codes'. Together they form a unique fingerprint.

Keyphrases

Mathematics

Computer Science