Classes and equivalence of linear sets in $PG(1,q^n)$
Bence Csajb\'ok, Giuseppe Marino, Olga Polverino

TL;DR
This paper investigates the classification and equivalence of linear sets in projective lines over finite fields, exploring their connections to varieties, blocking sets, and MRD-codes.
Contribution
It provides a comprehensive analysis of the equivalence problem for linear sets in PG(1,q^n), linking geometric and coding-theoretic structures.
Findings
Characterization of linear set equivalence classes
Connections between linear sets and MRD-codes
Insights into associated varieties and blocking sets
Abstract
The equivalence problem of -linear sets of rank n of is investigated, also in terms of the associated variety, projecting configurations, -linear blocking sets of R\'edei type and MRD-codes.
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
