Subspace coverings with multiplicities
From MaRDI portal
Publication:6632776
DOI10.1017/s0963548323000123MaRDI QIDQ6632776
Shagnik Das, Anurag Bishnoi, Simona Boyadzhiyska, Tamás Mészáros
Publication date: 5 November 2024
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Bounds on codes (94B65) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alon's nullstellensatz for multisets
- Punctured combinatorial Nullstellensätze
- The Jamison method in Galois geometries
- Polynomial multiplicities over finite fields and intersection sets
- Covering the cube by affine hyperplanes
- Covering finite fields with cosets of subspaces
- The blocking number of an affine space
- Partitions of vector spaces
- On intersection sets in Desarguesian affine spaces
- On almost \(k\)-covers of hypercubes
- On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces
- Some extensions of Alon's Nullstellensatz
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
- On Zeros of a Polynomial in a Finite Grid
- Improved upper bounds on sizes of codes
- Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives
- Covering all points except one
- Polynomials that vanish to high order on most of the hypercube
This page was built for publication: Subspace coverings with multiplicities
