On the Bias of Reed--Muller Codes over Odd Prime Fields
From MaRDI portal
Publication:5112827
DOI10.1137/18M1215104zbMath1454.94119arXiv1806.06973MaRDI QIDQ5112827
Shayan Oveis Gharan, Xin Yang, P. W. Beame
Publication date: 9 June 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.06973
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Polynomials over finite fields (11T06)
Related Items (3)
On the Bias of Reed--Muller Codes over Odd Prime Fields ⋮ Inclusion matrices for rainbow subsets ⋮ On hitting-set generators for polynomials that vanish rarely
Cites Work
- Unnamed Item
- Random low-degree polynomials are hard to approximate
- Explicit factorization of the Vandermonde matrix
- Generalized Hamming weights of affine Cartesian codes
- On the structure of cubic and quartic polynomials
- Reed–Muller Codes for Random Erasures and Errors
- On the weight enumeration of weights less than 2.5d of Reed—Muller codes
- Generalized Hamming weights of q-ary Reed-Muller codes
- On the Bias of Reed--Muller Codes over Odd Prime Fields
- Extractor-based time-space lower bounds for learning
- Weight Distribution and List-Decoding Size of Reed–Muller Codes
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- The List Decoding Radius for Reed–Muller Codes Over Small Fields
- On the weight structure of Reed-Muller codes
- Weight enumerator for second-order Reed-Muller codes
This page was built for publication: On the Bias of Reed--Muller Codes over Odd Prime Fields
