Projective planes, coverings and a network problem

DOI10.1023/A:1024140122167MaRDI QIDQ1404316zbMATH OpenOpenAlexFDO

Authors Stefano Marcugini, Fernanda Pambianco, Jürgen Bierbrauer

Publication date 21 August 2003

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1024140122167

zbMATH Keywords

projective planescodescoveringsdesignsarcsfractional coversfractional matchingsalmost projective planescongestion-free networks

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Finite affine and projective planes (geometric aspects) (51E15) Linear codes and caps in Galois spaces (51E22) Applications of design theory to circuits and networks (94C30)

Recommendations

• Projective Covering Designs
• On \(k\)-arcs covering a line in finite projective planes.
• Constructions and families of covering codes and saturated sets of points in projective geometry
• On \(q\)-covering designs
• scientific article; zbMATH DE number 3900774

Cited in

(6)

• Projective planes and congestion-free networks
• A projective plane is an outstanding 2-cover
• New quantum caps in \(\mathrm{PG}(4, 4)\)
• Upper bounds on the covering number of Galois-planes with small order
• Bounds on data limits for all-to-all comparison from combinatorial designs
• On \(k\)-arcs covering a line in finite projective planes.

This page was built for publication: Projective planes, coverings and a network problem

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