Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r, q)

DOI10.1002/JCD.20091MaRDI QIDQ5487773zbMATH OpenOpenAlexFDO

Authors Gerzson Kéri

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

zbMATH Keywords

superregular matrixMDS codecomplete \(n\)-arc

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)

Recommendations

• Correction to: Types of superregular matrices and the number ofn-arcs and completen-arcs in PG(r,q)
• scientific article; zbMATH DE number 1405326
• scientific article; zbMATH DE number 4099840
• On almost type classes of matrices withQ-property
• On the characteristic polynomial of supermatrices
• \(n\)-weakly supercyclic matrices
• Regular Matrices and P-Sets in βN \N. II
• On the superdeterminant function for supermatrices
• On sizes of complete arcs in \(PG(2,q)\)
• On sets of type \((m,n)_{r - 1}\) in PG\((r,q)\)

Cites work

• scientific article; zbMATH DE number 475084 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• An elementary proof and an extension of Thas' theorem on k-arcs
• Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs
• The main conjecture for MDS codes

Cited in

(19)

• On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)
• A full classification of the complete \(k\)-arcs of \(\mathrm{PG}(2,23)\) and \(\mathrm{PG}(2,25)\).
• scientific article; zbMATH DE number 6797335 (Why is no real title available?)
• A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices
• New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane
• Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
• Extending small arcs to large arcs
• Special sequences as subcodes of Reed-Solomon codes
• The complete \(k\)-arcs of \(PG(2, 27)\) and \(PG(2, 29)\)
• On the minimum size of complete arcs and minimal saturating sets in projective planes
• 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
• Inclusion matrices and the MDS conjecture
• Correction to: Types of superregular matrices and the number ofn-arcs and completen-arcs in PG(r,q)
• Further results on the classification of MDS codes
• On sizes of complete arcs in \(PG(2,q)\)
• Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
• On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
• The complete arcs of \(\mathrm{PG}(2,31)\)

This page was built for publication: Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r, q)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487773)