All minimal $[9,4]_{2}$-codes are hyperbolic quadrics
Valentino Smaldore

TL;DR
This paper proves that all minimal codes with parameters [9,4]_2 are hyperbolic quadrics by showing that all strong blocking sets of size 9 in PG(3,2) are hyperbolic quadrics, confirming a specific geometric characterization.
Contribution
It establishes that all minimal [9,4]_2-codes correspond to hyperbolic quadrics, providing a complete geometric classification in this case.
Findings
All strong blocking sets of size 9 in PG(3,2) are hyperbolic quadrics.
Confirms the geometric nature of minimal codes with these parameters.
Supports the link between minimal codes and geometric structures in projective spaces.
Abstract
Minimal codes are being intensively studied in last years. -minimal linear codes are in bijection with strong blocking sets of size in and a lower bound for the size of strong blocking sets is given by . In this note we show that all strong blocking sets of length 9 in are the hyperbolic quadrics .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · Finite Group Theory Research
