scientific article; zbMATH DE number 1795248
From MaRDI portal
Publication:4550672
Recommendations
- Galois geometries and coding theory
- Galois geometries and coding theory
- Open problems in finite projective spaces
- scientific article; zbMATH DE number 5043377
- scientific article; zbMATH DE number 2035103
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- Minimal and maximal arrangements of hyperplanes in \(\mathbb P^{n}(\mathbb {F}_{q})\)
- Small Strong Blocking Sets by Concatenation
- Finite geometries, varieties and codes
- Configuration in binary linear codes
Cited in
(only showing first 100 items - show all)- Sequences in abelian groups G of odd order without zero-sum subsequences of length (G)
- Random constructions and density results
- Complete \((q^2+q+8)/2\)-caps in the spaces \(\mathrm{PG}(3,q)\), \(q\equiv 2 \pmod 3\) an odd prime, and a complete 20-cap in \(\mathrm{PG}(3,5)\)
- A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression
- On the maximality of linear codes
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)
- Monomial flocks and herds containing a monomial oval
- Complete arcs
- On saturating sets in projective spaces.
- An orderly algorithm and some applications in finite geometry
- Covering arrays from m-sequences and character sums
- Complete \((k,4)\)-arcs from quintic curves
- Unitals with many Baer secants through a fixed point
- Completeness of the 95256-cap in \(\mathrm{PG}(12, 4)\)
- A new \((37, 3)\)-arc in \(\mathrm{PG}(2,23)\)
- Improved lower bounds on \(m_r(2,29)\)
- Some new \((n, r)\)-arcs in \(\mathrm{PG}(2, 31)\)
- On the sharpness of the Griesmer bound
- Occurrence of right angles in vector spaces over finite fields
- Extending small arcs to large arcs
- On the minimum size of some minihypers and related linear codes
- Euclidean and Hermitian LCD MDS codes
- Caps in the projective geometry PG\((n,4)\)
- Caps of order 3\(q^{2}\) in affine 4-space in characteristic 2
- The classification of the largest caps in AG(5, 3)
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane
- Almost affinely disjoint subspaces
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
- Existence of canonically inherited arcs in Moulton planes of odd order
- Nonexistence of linear codes meeting the Griesmer bound
- Approximately strongly regular graphs
- The geometric approach to the existence of some quaternary Griesmer codes
- Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\)
- A construction for infinite families of semisymmetric graphs revealing their full automorphism group
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- Improved bounds on \(m_r(2,q)q=19,25,27\)
- Small complete caps from singular cubics. II
- Some low-density parity-check codes derived from finite geometries
- On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes
- New bounds for linear codes of covering radii 2 and 3
- Absorbing sets of codes from finite geometries
- Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- On small line sets with few odd-points
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture
- A geometric approach to classifying Griesmer codes
- A construction of small complete caps in projective spaces
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- Algebraic manipulation detection codes
- On the minimum size of complete arcs and minimal saturating sets in projective planes
- Small complete caps in three-dimensional Galois spaces
- Caps in \(\mathrm{PG}(n,q)\) with \(q\) even and \(n\geq 3\)
- Four classes of permutation polynomials of \(\mathbb F_{2^m}\)
- On the completeness of certain n-tracks arising from elliptic curves
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- Open problems in finite projective spaces
- Bounds on (n,r)-arcs and their application to linear codes
- On multiple caps in finite projective spaces
- Construction of quantum caps in projective space \(\mathrm{PG}(r,4)\) and quantum codes of distance 4
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
- On encoding symbol degrees of array BP-XOR codes
- Large blocking sets in \(\mathrm{PG}(2,q^2)\)
- Complete \((k,3)\)-arcs from quartic curves
- Maximal integral point sets over ℤ2
- Binary caps with many free pairs of points
- Bicovering arcs and small complete caps from elliptic curves
- Extension theorems for linear codes over finite fields
- Constructing heterogeneous hash families by puncturing linear transversal designs
- An extension theorem for arcs and linear codes
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- scientific article; zbMATH DE number 2035103 (Why is no real title available?)
- The main conjecture for MDS codes
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N \geq 3\), under a certain probabilistic conjecture
- Large caps in projective space \(\mathrm{PG}(r, 4)\)
- Bounds on m_r(2,29)
- On the Computation of Conjugation Classes of Elements of PGL(3, q)
- On the completeness of plane cubic curves over finite fields
- Non-existence of some 4-dimensional Griesmer codes over finite fields
- On arcs and quadrics
- Note on disjoint blocking sets in Galois planes
- Maximal (\(n\),3)-arcs in PG(2,13)
- On (k,n)-arcs
- Improved bounds on sizes of generalized caps in \(AG(n,q)\)
- New large \((n, r)\)-arcs in \(\mathrm{PG}(2, q)\)
- On the size of complete caps in PG\((3,2^{h}\))
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Exponentially larger affine and projective caps
- Detecting arrays for effects of single factors
- Upper bounds on the length function for covering codes with covering radius R and codimension tR+1
- Coloring unions of nearly disjoint hypergraph cliques
- On the weight distribution of the cosets of MDS codes
- Vandermonde sets, hyperovals and Niho bent functions
- On additive MDS codes over small fields
- Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)
- On sizes of complete arcs in \(PG(2,q)\)
- Further results on covering codes with radius R and codimension tR+1
- An asymptotic property of quaternary additive codes
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- On the minimum length of linear codes of dimension 5
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550672)
