Primitive polynomials and word oriented linear feedback shift registers
Shuqin Fan
Abstract
Shuqin Fan
Abstract
Through a large number of experiments, an explicit formula was proposed for the number of primitive σ-LFSRs over finite field, which generalized a known formula for the number of primitive LFSRs over finite field, and also was the extension of the number of primitive polynomial.Utilizing the given methods to distinguish the primitive σ-LFSR, the conjecture in three special cases was proved and a preliminary analysis for the general case was given.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Through a large number of experiments, an explicit formula was proposed for the number of primitive σ-LFSRs over finite field, which generalized a known formula for the number of primitive LFSRs over finite field, and also was the extension of the number of primitive polynomial.Utilizing the given methods to distinguish the primitive σ-LFSR, the conjecture in three special cases was proved and a preliminary analysis for the general case was given.
Key concepts: Primitive polynomial, Finite field, Shift register, Primitive element, Mathematics, Primitive root modulo n, Word (group theory), Polynomial