Title :
Permutation polynomials and nonsingular feedback shift registers over finite fields
Author_Institution :
Dept. of Math., Pennsylvania State Univ., Univ. Park, PA
fDate :
7/1/1989 12:00:00 AM
Abstract :
A necessary and sufficient condition is established for nonsingularity of a feedback shift-register of degree at most two over a finite field. Several relations between permutation polynomials and nonsingular feedback shift-registers over finite fields are also studied. Four theorems are given and discussed
Keywords :
binary sequences; feedback; information theory; polynomials; shift registers; feedback shift registers; finite fields; necessary and sufficient condition; nonsingularity; permutation polynomials; Ash; Convolutional codes; Decoding; Error probability; Feedback; Galois fields; Memory; Polynomials; Shift registers; Sufficient conditions;
Journal_Title :
Information Theory, IEEE Transactions on
