On minimal codes arising from projective embeddings of point-line geometries
By: Ilaria Cardinali, Luca Giuzzi
Potential Business Impact:
Makes computer codes for math problems simpler.
Let ${\mathcal C}(Ω)$ be the linear code arising from a projective system $Ω$ of $\mathrm{PG}(V).$ Consider the point-line geometry $Γ=({\mathcal P},{\mathcal L})$ and a projective embedding $\varepsilon\colon Γ\rightarrow \mathrm{PG}(V)$ of $Γ.$ We show that the projective code obtained by taking as projective system $Ω:=\varepsilon(\mathcal{P})$ is minimal if the graph induced on the set $Γ\setminus\varepsilon^{-1}(H)$ by the collinearity graph of $Γ$ is connected for any hyperplane $H$ of $\mathrm{PG}(V)$. As an application, Grassmann codes, Segre codes, polar Grassmann codes of orthogonal, symplectic, hermitian type and codes arising from the point-hyperplane geometry of a projective space are minimal codes.
Similar Papers
Linear codes arising from the point-hyperplane geometry-Part I: the Segre embedding
Combinatorics
Makes secret codes that are hard to break.
Linear codes over $\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}$ with mixed-alphabet defining sets and their Gray images: Constructions of projective few-weight, distance-optimal and minimal codes
Information Theory
Creates better codes for secret messages and sharing.
Generalized ovals, 2.5-dimensional additive codes, and multispreads
Combinatorics
Finds more ways to send secret messages safely.