Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
Minimal polynomial (field theory)
Known as:
Extension field minimal polynomial
, Minimal polynomial
In field theory, a branch of mathematics, a minimal polynomial is defined relative to a field extension E/F and an element of the extension field E…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
BCH code
Berlekamp–Massey algorithm
Conway polynomial (finite fields)
Cyclotomic polynomial
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A complete algorithm to find exact minimal polynomial by approximations
Xiaolin Qin
,
Yong Feng
,
Jingwei Chen
,
Jingzhong Zhang
International Journal of Computational…
2010
Corpus ID: 14602685
Based on an improved parameterized integer relation construction method, a complete algorithm is proposed for finding an exact…
Expand
2010
2010
Algorithms for solving linear systems over cyclotomic fields
Liang-Ting Chen
,
M. Monagan
Journal of symbolic computation
2010
Corpus ID: 2613230
Review
2009
Review
2009
The BMS Algorithm and Decoding of AG Codes
S. Sakata
Gröbner Bases, Coding, and Cryptography
2009
Corpus ID: 86865712
In this paper, we review various decoding methods of algebraic geometry (or algebraic-geometric) codes (Goppa in Soviet Math…
Expand
2005
2005
Optimal Substructures in Optimal and Approximate Circle Packings
P. Szabó
2005
Corpus ID: 15822591
This paper deals with the densest packing of equal circles in a square problem. Sharp bounds for the density of optimal circle…
Expand
2002
2002
A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF(q)
Shimin Wei
,
G. Xiao
,
Zhong Chen
IEEE Transactions on Information Theory
2002
Corpus ID: 206736457
A fast algorithm is presented for determining the linear complexity and the minimal polynomial of a sequence with period 2p/sup n…
Expand
1998
1998
On Cyclotomic Generator of Order r
C. Ding
,
T. Helleseth
Information Processing Letters
1998
Corpus ID: 35436015
1996
1996
Subspace methods for blind identification of SIMO-FIR systems
É. Moulines
,
J. Cardoso
,
A. Gorokhov
,
P. Loubaton
IEEE International Conference on Acoustics…
1996
Corpus ID: 2225177
Blind identification of single-input multiple-output (SIMO) FIR systems based on second order statistics has attracted a lot of…
Expand
1988
1988
Windmill Generators: A Generalization and an Observation of How Many There Are
B. Smeets
,
W. G. Chambers
International Conference on the Theory and…
1988
Corpus ID: 13568287
The windmill technique has several practical advantageous over other techniques for high-speed generation or blockwise generation…
Expand
1982
1982
A note on complete intersections
BY S. M. Bhatwadekar
1982
Corpus ID: 53350448
Let R be a regular local ring and let R(T) be a polynomial algebra in one variable over R. In this paper the author proves that…
Expand
Highly Cited
1975
Highly Cited
1975
On the synthesis of linear control systems with specified characteristics
J. Ackermann
at - Automatisierungstechnik
1975
Corpus ID: 40173248
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