Largest minimal blocking sets in PG(2,8)

From MaRDI portal
Publication:4808409

DOI10.1002/JCD.10035zbMATH Open1028.51010OpenAlexW2033913132MaRDI QIDQ4808409FDOQ4808409


Authors: János Barát, Stefano Innamorati Edit this on Wikidata


Publication date: 22 May 2003

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.10035




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Largest minimal blocking sets in PG(2,8)

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