scholarly journals Linear sets and MRD-codes arising from a class of scattered linearized polynomials

Author(s):  
Giovanni Longobardi ◽  
Corrado Zanella

AbstractA class of scattered linearized polynomials covering infinitely many field extensions is exhibited. More precisely, the q-polynomial over $${{\mathbb {F}}}_{q^6}$$ F q 6 , $$q \equiv 1\pmod 4$$ q ≡ 1 ( mod 4 ) described in Bartoli et al. (ARS Math Contemp 19:125–145, 2020) and Zanella and Zullo (Discrete Math 343:111800, 2020) is generalized for any even $$n\ge 6$$ n ≥ 6 to an $${{{\mathbb {F}}}_q}$$ F q -linear automorphism $$\psi (x)$$ ψ ( x ) of $${{\mathbb {F}}}_{q^n}$$ F q n of order n. Such $$\psi (x)$$ ψ ( x ) and some functional powers of it are proved to be scattered. In particular, this provides new maximum scattered linear sets of the projective line $${{\,\mathrm{{PG}}\,}}(1,q^n)$$ PG ( 1 , q n ) for $$n=8,10$$ n = 8 , 10 . The polynomials described in this paper lead to a new infinite family of MRD-codes in $${{\mathbb {F}}}_q^{n\times n}$$ F q n × n with minimum distance $$n-1$$ n - 1 for any odd q if $$n\equiv 0\pmod 4$$ n ≡ 0 ( mod 4 ) and any $$q\equiv 1\pmod 4$$ q ≡ 1 ( mod 4 ) if $$n\equiv 2\pmod 4$$ n ≡ 2 ( mod 4 ) .

2010 ◽  
Vol 56 (2-3) ◽  
pp. 89-104 ◽  
Author(s):  
M. Lavrauw ◽  
G. Van de Voorde
Keyword(s):  

2018 ◽  
Vol 54 ◽  
pp. 133-150 ◽  
Author(s):  
Bence Csajbók ◽  
Giuseppe Marino ◽  
Ferdinando Zullo
Keyword(s):  

2017 ◽  
Vol 46 (3-4) ◽  
pp. 517-531 ◽  
Author(s):  
Bence Csajbók ◽  
Giuseppe Marino ◽  
Olga Polverino ◽  
Ferdinando Zullo
Keyword(s):  

2020 ◽  
Vol 8 ◽  
Author(s):  
JOSEPH W. IVERSON ◽  
JOHN JASPER ◽  
DUSTIN G. MIXON

We provide a general program for finding nice arrangements of points in real or complex projective space from transitive actions of finite groups. In many cases, these arrangements are optimal in the sense of maximizing the minimum distance. We introduce our program in terms of general Schurian association schemes before focusing on the special case of Gelfand pairs. Notably, our program unifies a variety of existing packings with heretofore disparate constructions. In addition, we leverage our program to construct the first known infinite family of equiangular lines with Heisenberg symmetry.


2017 ◽  
Vol 149 ◽  
pp. 1-20 ◽  
Author(s):  
Guglielmo Lunardon
Keyword(s):  

2013 ◽  
Vol 373-375 ◽  
pp. 1695-1698
Author(s):  
Ying Li ◽  
Ye Bin Chen ◽  
Tao Chen

Used equivalent tree to construct the minimum distance diagram of triple loop networks and found the relationships between the layer of the equivalent tree and the shortest path of any two points in triple loop networks, and provided a formula to compute its average diameter. The experimental results show that average diameter approaches to a half of the diameter at the same network, in one infinite family, the diameter must obtain minimum value when average diameter obtains the minimum value, but the inverse is not. Studies also show that average diameter is the better parameter to measure transmission efficiency about loop networks instead of diameter.


2021 ◽  
Vol 344 (6) ◽  
pp. 112359
Author(s):  
Giovanni Zini ◽  
Ferdinando Zullo

Sign in / Sign up

Export Citation Format

Share Document