On the Alon-Füredi bound
From MaRDI portal
Publication:510534
DOI10.1016/j.endm.2016.09.011zbMath1420.05182OpenAlexW2538475633MaRDI QIDQ510534
John R. Schmitt, Aditya Potukuchi, Pete L. Clark, Anurag Bishnoi
Publication date: 13 February 2017
Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.011
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial structures in finite projective spaces (51E20) Combinatorial aspects of commutative algebra (05E40)
Related Items (2)
Minimum distance functions of complete intersections ⋮ More results on the number of zeros of multiplicity at least \(r\)
Cites Work
- Unnamed Item
- The Combinatorial Nullstellensätze revisited
- Punctured combinatorial Nullstellensätze
- Erratum. Punctured combinatorial Nullstellensätze
- Partial covers of \(\mathrm{PG}(n, q)\)
- On the second weight of generalized Reed-Muller codes
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- Covering the cube by affine hyperplanes
- Covering finite fields with cosets of subspaces
- The blocking number of an affine space
- A probabilistic remark on algebraic program testing
- Warning's second theorem with restricted variables
- Affine Cartesian codes
- On the second Hamming weight of some Reed-Muller type codes
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- On Zeros of a Polynomial in a Finite Grid
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
This page was built for publication: On the Alon-Füredi bound
