2013
DOI: 10.1016/j.ffa.2013.03.003
|View full text |Cite
|
Sign up to set email alerts
|

Linearized polynomials over finite fields revisited

Abstract: We give new characterizations of the algebra L n (F q n ) formed by all linearized polynomials over the finite field F q n after briefly surveying some known ones. One isomorphism we construct is between L n (F q n ) and the composition algebra F ∨ q n ⊗ Fq F q n . The other isomorphism we construct is between L n (F q n ) and the so-called Dickson matrix algebra D n (F q n ). We also further study the relations between a linearized polynomial and its associated Dickson matrix, generalizing a well-known criter… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
81
0
2

Year Published

2014
2014
2019
2019

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 100 publications
(83 citation statements)
references
References 13 publications
0
81
0
2
Order By: Relevance
“…Lfalse(L,K,σfalse):={ffalse(Xfalse)=f0X+f1Xσ++fn1Xσn1:fiL}.Clearly any linearized polynomial defines a K‐linear map of L, false[xf(x)false]normalEndKfalse(Lfalse). If we define the product of linearized polynomials to be composition, and identify Xσn with X, then we get a ring isomorphism (see, for example, ): Lfalse(L,K,σfalse)normalEndKfalse(Lfalse).Note that from this correspondence, we may say that a code is L‐linear if the corresponding set of linearized polynomials is closed under multiplication by L. We can also move easily from linearized polynomials to vectors in Lm, simply by evaluating a polynomial f on a set of elements {α1,,αm} of L, linearly independent over K.…”
Section: Semifields and Maximum Rank Distance Codesmentioning
confidence: 99%
“…Lfalse(L,K,σfalse):={ffalse(Xfalse)=f0X+f1Xσ++fn1Xσn1:fiL}.Clearly any linearized polynomial defines a K‐linear map of L, false[xf(x)false]normalEndKfalse(Lfalse). If we define the product of linearized polynomials to be composition, and identify Xσn with X, then we get a ring isomorphism (see, for example, ): Lfalse(L,K,σfalse)normalEndKfalse(Lfalse).Note that from this correspondence, we may say that a code is L‐linear if the corresponding set of linearized polynomials is closed under multiplication by L. We can also move easily from linearized polynomials to vectors in Lm, simply by evaluating a polynomial f on a set of elements {α1,,αm} of L, linearly independent over K.…”
Section: Semifields and Maximum Rank Distance Codesmentioning
confidence: 99%
“…Recently, the compositional inverse of of some linearized permutation polynomials have been discovered. For detailed information, the reader is referred to [11,[30][31][32].…”
Section: Preliminariesmentioning
confidence: 99%
“…Very recently, more relations between properties of L(x) and D L (called the associated Dickson matrix of L(x)) are found by the author and Liu [11].…”
Section: A Quadratic Bent Functionsmentioning
confidence: 99%