Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,502,422 papers from all fields of science
Search
Sign In
Create Free Account
Linearised polynomial
Known as:
Linearized polynomial
In mathematics, a linearised polynomial (or q- polynomial) is a polynomial for which the exponents of all the constituent monomials are powers of q…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Monomial
Permutation polynomial
Polynomial
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Lagrangian Approach for Computational Acoustics with Meshfree Method
Yongou Zhang
,
S. G. L. Smith
,
Zhang Tao
,
Tianyun Li
2017
Corpus ID: 34847636
Although Eulerian approaches are standard in computational acoustics, they are less effective for certain classes of problems…
Expand
2016
2016
Dembowski-Ostrom polynomials from reversed Dickson polynomials
Xiaoming Zhang
,
Baofeng Wu
,
Zhuojun Liu
Journal of Systems Science and Complexity
2016
Corpus ID: 43347631
This paper gives a full classification of Dembowski-Ostrom polynomials derived from the compositions of reversed Dickson…
Expand
2015
2015
From r-linearized polynomial equations to rm-linearized polynomial equations
Neranga Fernando
,
Xiang-dong Hou
Finite Fields Their Appl.
2015
Corpus ID: 40445131
2015
2015
Design of cyclotomic Fast Fourier Transform architecture over Galois field for 15 point DFT
Tejaswini P. Deshmukh
,
P. Deshmukh
,
P. Dakhole
International Conference on Intelligent Computing
2015
Corpus ID: 8551734
The Fast Fourier Transform can be determined in Complex field and Galois field. The paper suggests the architecture for finding…
Expand
2014
2014
Gröbner Bases for Linearized Polynomials
M. Kuijper
,
Anna-Lena Horlemann-Trautmann
arXiv.org
2014
Corpus ID: 15737529
In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with…
Expand
2010
2010
A note on the reducibility of binary affine polynomials
Zhengjun Zhao
,
X. Cao
Des. Codes Cryptogr.
2010
Corpus ID: 1953957
Stickelberger–Swan Theorem is an important tool for determining parity of the number of irreducible factors of a given polynomial…
Expand
2007
2007
Highly degenerate quadratic forms over F2
R. Fitzgerald
Finite Fields Their Appl.
2007
Corpus ID: 19497910
2007
2007
Generation of differentiable homomorphism function based on self-organizing polynomial data-mining algorithm
Youngwook Kim
,
T. Narikiyo
7th Internatonal Conference on Power Electronics
2007
Corpus ID: 26285097
This paper presents a new controller design method based on the data-mining polynomial algorithm. We show application of a…
Expand
2004
2004
Multiport power amplifier: a flexible architecture for multi-channel amplification on board satellites [linearized TWTs]
F. André
Fifth IEEE International Vacuum Electronics…
2004
Corpus ID: 22070748
Summary form only given. The amplification of multiple signals on board telecommunication satellites is normally implemented with…
Expand
1986
1986
Discriminants and the irreducibility of a class of polynomials
Oscar Moreno de Ayala
International Symposium on Applied Algebra…
1986
Corpus ID: 16951318
There has been some interest in finding irreducible polynomial of the type f(A(x)) for certain classes of linearized polynomials…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE