Polynomial multiplicities over finite fields and intersection sets
From MaRDI portal
Publication:1186107
DOI10.1016/0097-3165(92)90035-SzbMath0754.05024MaRDI QIDQ1186107
Publication date: 28 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
finite fieldshyperplanesprojective spacesnon-Desarguesian planescoverings by subspacesintersection setspolynomial multiplicities
Combinatorial aspects of finite geometries (05B25) Finite fields (field-theoretic aspects) (12E20) Special polynomials in general fields (12E10) Translation planes and spreads in linear incidence geometry (51A40)
Related Items
On multiple blocking sets in Galois planes ⋮ Multiple blocking sets and multisets in Desarguesian planes ⋮ Applications of finite fields to combinatorics and finite geometries ⋮ Intersection-sets in \(PG(n,2)\) ⋮ Affine blocking sets, three-dimensional codes and the Griesmer bound ⋮ On low weight codewords of generalized affine and projective Reed-Muller codes ⋮ Punctured combinatorial Nullstellensätze ⋮ Covering grids with multiplicity ⋮ A general construction for blocking sets in finite affine geometries ⋮ The Jamison method in Galois geometries ⋮ The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q) ⋮ A \(p\)-adic condition on the weight of a codeword of a linear code ⋮ On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces ⋮ On the minimum size of some minihypers and related linear codes ⋮ Proof of a conjecture of Metsch ⋮ Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound ⋮ Characterizations of Hermitian varieties by intersection numbers ⋮ Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives ⋮ Blocking sets in Desarguesian affine and projective planes ⋮ On intersection sets in Desarguesian affine spaces ⋮ On nuclei and blocking sets in Desarguesian spaces ⋮ Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes ⋮ The packing problem in statistics, coding theory and finite projective spaces ⋮ Nonexistence of \([n,5,d_q\) codes attaining the Griesmer bound for \(q^4-2q^2-2q+1\leq d\leq q^4-2q^2-q\).] ⋮ Linear \((q+1)\)-fold blocking sets in \(\text{PG} (2,q^4)\) ⋮ On a particular class of minihypers and its applications. II: Improvements for \(q\) square
Cites Work
