Blocking planes by lines in PG(n,q)

DOI10.1007/S10623-025-01678-WMaRDI QIDQ6909180zbMATH OpenFDO

Authors B. Kovacs, Zoltán Lóránt Nagy, Dávid R. Szabó

Publication date 30 October 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-025-01678-W

zbMATH Keywords

\(q\)-covering designs\(q\)-Turán designsblocking setsGrassmannianprojective spaces

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21)

Cites work

• A characteristic property of geometric \(t\)-spreads in finite projective spaces
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• A note on \(q\)-covering designs in \(\mathrm{PG}(5,q)\)
• Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
• Blocking sets in projective spaces and polar spaces
• Blocking subspaces by lines in \(PG(n,q)\)
• Bose-Burton type theorems for finite Grassmannians
• Coding for Errors and Erasures in Random Network Coding
• Covering of subspaces by subspaces
• Existence of q-analogs of Steiner systems
• scientific article; zbMATH DE number 1342088 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• Maximum scattered linear sets and MRD-codes
• On q-analogs of Steiner systems and covering designs
• On \(q\)-covering designs
• Shadows and intersections in vector spaces
• Subspace packings: constructions and bounds
• Theory of codes with maximum rank distance
• Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe

This page was built for publication: Blocking planes by lines in \(\mathrm{PG}(n,q)\)

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