Skip to search formSkip to main contentSkip to account menu

Primitive polynomial (field theory)

Known as: Primitive polynomial 
In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF(pm… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
All one polynomialConway polynomial (finite fields)Cyclic redundancy checkGauss's lemma (polynomial)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A Class of de Bruijn Sequences
In this paper, a class of linear feedback shift registers (LFSRs) with characteristic polynomial (1 + x3)p(x) is discussed, where… 
2013
2013
A binarization of geometric sequences with Legendre symbol and its autocorrelation
Let p be an odd characteristic and m be the degree of primitive polynomial f(x). Let ω be its zero, that is a primitive element… 
2012
2012
FPGA Implementation of Encoder for (15, k) Binary BCH Code Using VHDL and Performance Comparison for Multiple Error Correction Control
In this paper we have designed and implemented (15, k) a BCH Encoder on FPGA using VHDL for reliable data transfer in AWGN… 
2011
2011
Selection of polynomials for cyclic redundancy check for the use of high speed embedded: an algorithmic procedure
Cyclic Redundancy Check (CRC) technique which is widely used tools in globally standardized telecommunications systems for… 
2006
2006
Linear Sequential Circuit Approximation of Grain and Trivium Stream Ciphers
Grain and Trivium are two hardware oriented synchronous stream ciphers proposed as the simplest candidates to the ECRYPT Stream… 
Review
2005
Review
2005
All-optical signal Processing and applications within the esprit project DO/spl I.bar/ALL
This paper reviews the work performed under the European ESPRIT project DO/spl I.bar/ALL (Digital OpticAL Logic modules) spanning… 
2004
2004
The three fixed coefficient primitive polynomial theorem
Highly Cited
1999
Highly Cited
1999
On calculating efficient LFSR seeds for built-in self test
Linear Feedback Shift Registers (LFSRs) are commonly used as pseudo-random test pattern generators (TPGs) in BIST schemes. This… 
1993
1993
Primitive polynomials and M-sequences over GF(qm)
Procedures for obtaining primitive polynomials and m-sequences over GF(q/sup m/) in terms of primitive polynomials and m… 
Highly Cited
1969
Highly Cited
1969
Primitive Trinomials Whose Degree is a Mersenne Exponent
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)