Covering finite fields with cosets of subspaces

From MaRDI portal
Publication:1236571

DOI10.1016/0097-3165(77)90001-2zbMath0354.12019OpenAlexW2092976320WikidataQ60306530 ScholiaQ60306530MaRDI QIDQ1236571

Robert E. Jamison

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(77)90001-2



Related Items

On nuclei and affine blocking sets, Blocking and double blocking sets in finite planes, On the sharpness of a theorem of B. Segre, More on maximal intersecting families of finite sets, A new lower bound for the size of an affine blocking set, Covering symmetric sets of the Boolean cube by affine hyperplanes, Arcs and blocking sets. II, Multiple blocking sets and multisets in Desarguesian planes, Applications of finite fields to combinatorics and finite geometries, Coverings of Abelian groups and vector spaces., Covering modules by proper submodules, Heden's bound on maximal partial spreads, A note on intersecting hypergraphs with large cover number, Minimal Symmetric Differences of Lines in Projective Planes, Linearized polynomial maps over finite fields, On the stability of small blocking sets, On the lower bound for the length of minimal codes, Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\), On \(q\)-analogues and stability theorems, Punctured combinatorial Nullstellensätze, Unique reducibility of multiple blocking sets, Covering grids with multiplicity, Some self-blocking block designs, Three parameters of Boolean functions related to their constancy on affine spaces, A general construction for blocking sets in finite affine geometries, Nuclei of sets of \(q+1\) points in PG(2,q) and blocking sets of Redei type, Hyperplane coverings and blocking sets, On almost \(k\)-covers of hypercubes, A stability theorem for lines in Galois planes of prime order, The Jamison method in Galois geometries, On Zeros of a Polynomial in a Finite Grid, Lower bounds on Tuza constants for transversals in linear uniform hypergraphs, Relative blocking sets of unions of Baer subplanes, Polynomial multiplicities over finite fields and intersection sets, Covers in partitioned intersecting hypergraphs, Small transversals in hypergraphs, On the Alon-Füredi bound, On bisecants of Rédei type blocking sets and applications, The Sperner capacity of linear and nonlinear codes for the cyclic triangle, 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, Blocking structures of Hermitian varieties, Proof of a conjecture of Metsch, Uncertainty in finite planes, Dimensions of hyperplane spaces over finite fields, The number of non-homogeneous lattice points in plane subsets, The blocking number of an affine space, Covering all points except one, Constructing Minimal Blocking Sets Using Field Reduction, Blocking sets in Desarguesian affine and projective planes, Matchings and covers in hypergraphs, On the metric dimension of affine planes, biaffine planes and generalized quadrangles, On intersection sets in Desarguesian affine spaces, On nuclei and blocking sets in Desarguesian spaces, Smallest cyclically covering subspaces of \(\mathbb{F}_q^n\), and lower bounds in Isbell's conjecture, On blocking sets in affine planes, Local constraints ensuring small representing sets, Small blocking sets of Hermitian designs, On the size of a blocking set in \(\text{PG}(2,p)\), Avoiding arithmetic progressions in cyclic groups



Cites Work