首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Linearized trinomials with maximum kernel
Authors:Paolo Santonastaso  Ferdinando Zullo
Institution:1. Department of Mathematics, University of Western Ontario, London, Ontario, Canada;2. Department of Mathematics, University of Ljubljana, Jadranska Ulica 21, 1000 Ljubljana, Slovenia;1. Universidad de Cádiz, Puerto Real, Cádiz, Spain;2. CMCC, Universidade Federal do ABC, Santo André, Brazil;3. CMUP, Faculdade de Ciências, Universidade do Porto, Porto, Portugal;4. Moscow Center for Fundamental and Applied Mathematics, Moscow, Russia;5. Departamento de Matemática, Universidade Federal de Santa Catarina, Florianópolis, Brazil;6. Departamento de Matemática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Caparica, Portugal;7. Saint Petersburg University, Saint Petersburg, Russia;1. Utah State University, Department of Mathematics and Statistics, Logan UT 84341, USA;2. Hung Vuong University, Faculty of Natural Sciences, Viet Tri, Phu Tho, Viet Nam;3. Université Bretagne Sud, Laboratoire de Mathématiques de Bretagne Atlantique, UMR CNRS 6205, Campus de Tohannic, BP 573 F-56017 Vannes, France;1. State University of Campinas, 651 Sergio Buarque de Holanda, 13083-859 Campinas, SP, Brazil;2. Technische Universität München, Zentrum Mathematik - M11, Boltzmannstr. 3, 85748 Garching, Germany;1. Department of Mathematics, University of Western Ontario, London, Ontario, N6A 5B7, Canada;2. University of Regina, 3737 Wascana Parkway, Regina, Saskatchewan, S4S 0A2, Canada
Abstract:Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let q be a prime power, n be a positive integer and σ be a generator of Gal(Fqn:Fq). In this paper we provide closed formulas for the coefficients of a σ-trinomial f over Fqn which ensure that the dimension of the kernel of f equals its σ-degree, that is linearized polynomials with maximum kernel. As a consequence, we present explicit examples of linearized trinomials with maximum kernel and characterize those having σ-degree 3 and 4. Our techniques rely on the tools developed in 24]. Finally, we apply these results to investigate a class of rank metric codes introduced in 8], to construct quasi-subfield polynomials and cyclic subspace codes, obtaining new explicit constructions to the conjecture posed in 37].
Keywords:Linearized polynomial  Closed formula  Subspace polynomial  Rank metric code  Cyclic subspace code  Quasi-subfield polynomial
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号