2019/10/05 by Daniele Bartoli, Corrado Zanella, Bartoli, Daniele +3
Computer Science · Engineering · Mathematics · #05B25 #51E20 #51E22 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1910.02278
openalex publication_date 2019/10/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We generalize the example of linear set presented by the last two authors in "Vertex properties of maximum scattered linear sets of PG(1,qn)" (2019) to a more general family, proving that such linear sets are maximum scattered when q is odd and, apart from a special case, they are are new. This solves an open problem posed in "Vertex properties of maximum scattered linear sets of PG(1,qn)" (2019). As a consequence of Sheekey's results in "A new family of linear maximum rank distance codes" (2016), this family yields to new MRD-codes with parameters (6,6,q;5).