On the size of minimal blocking sets of Q(4; q ), for q = 5,7

DOI10.1145/1040034.1040037zbMath1341.51010OpenAlexW1976677241MaRDI QIDQ5739501

Storme, L., Jan De Beule, Albert Hoogewijs

Publication date: 18 July 2016

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1040034.1040037

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Blocking sets, ovals, (k)-arcs (51E21)

Related Items (2)

On the smallest minimal blocking sets of \(Q(2n,q)\), for \(q\) an odd prime ⋮ Minimal blocking sets of size \(q^2+2\) of \(Q(4,q)\), \(q\) an odd prime, do not exist

This page was built for publication: On the size of minimal blocking sets of Q(4; q ), for q = 5,7