Linear codes arising from the point-hyperplane geometry-Part I: the Segre embedding
Ilaria Cardinali, Luca Giuzzi

TL;DR
This paper investigates a linear code derived from the Segre embedding of a point-hyperplane geometry, determining its parameters, automorphisms, and characterizing key codewords through geometric properties.
Contribution
It introduces a new linear code from the Segre embedding, fully characterizes its parameters, automorphism group, and describes special codewords geometrically.
Findings
The code is minimal.
Parameters and weight distribution are explicitly determined.
Geometric characterization of minimum and second minimum weight codewords.
Abstract
Let be a vector space over the finite field with elements and be the image of the Segre geometry in . Consider the subvariety of represented by the pure tensors with and such that . Regarding as a projective system of , we study the linear code arising from it. The code is minimal code and we determine its basic parameters, itsfull weight list and its linear automorphism group. We also give a geometrical characterization of its minimum and second lowest weight codewords as well as of some of the words of maximum weight.
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 · Advanced Wireless Communication Techniques
