Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r, q)
From MaRDI portal
Publication:5487773
DOI10.1002/jcd.20091zbMath1136.51008MaRDI QIDQ5487773
Publication date: 12 September 2006
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20091
94B05: Linear codes (general theory)
15B33: Matrices over special rings (quaternions, finite fields, etc.)
51E22: Linear codes and caps in Galois spaces
05B25: Combinatorial aspects of finite geometries
51E21: Blocking sets, ovals, (k)-arcs
Related Items
The Complete Arcs of PG(2,31), Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search, Further results on the classification of MDS codes, A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices, On sizes of complete arcs in \(PG(2,q)\), Inclusion matrices and the MDS conjecture, Special sequences as subcodes of Reed-Solomon codes, On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\), New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane, 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, On the minimum size of complete arcs and minimal saturating sets in projective planes, The complete k-arcs of PG(2, 27) and PG(2, 29), A full classification of the complete k‐arcs of PG(2,23) and PG(2,25)
Cites Work
