Proofs of Two Conjectures On the Dimensions of Binary Codes
Junhua Wu

TL;DR
This paper proves two conjectures regarding the dimensions of specific binary codes derived from incidence structures in finite projective planes, using finite geometry and modular representation theory.
Contribution
It provides the first rigorous proof of conjectures on the dimensions of codes associated with conic incidences in projective planes, combining geometric and algebraic methods.
Findings
Confirmed the conjectures on code dimensions
Established connections between geometry and modular representation theory
Enhanced understanding of binary codes from finite geometries
Abstract
Let and be the binary codes generated by the column -null space of the incidence matrix of external points versus passant lines and internal points versus secant lines with respect to a conic in , respectively. We confirm the conjectures on the dimensions of and using methods from both finite geometry and modular representation theory.
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 · graph theory and CDMA systems · Finite Group Theory Research
