Permutation polynomials and nonsingular feedback shift registers over finite fields
From MaRDI portal
DOI10.1109/18.32171zbMATH Open0698.94005OpenAlexW2050010972MaRDI QIDQ3476743FDOQ3476743
Authors: Gary L. Mullen
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.32171
Recommendations
- Nonsingular polynomials from feedback shift registers
- Condition for the nonsingularity of a feedback shift-register over a general finite field (Corresp.)
- On the cycle structure of certain classes of nonlinear shift registers
- scientific article; zbMATH DE number 5630444
- Nonsingularity of feedback shift registers
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Polynomials over finite fields (11T06)
Cited In (5)
- Condition for the nonsingularity of a feedback shift-register over a general finite field (Corresp.)
- A note on cyclotomic polynomials and Linear Feedback Shift Registers
- Algebraic Feedback Shift Registers Based on Function Fields
- Title not available (Why is that?)
- Nonsingularity of Trivium-like cascade FSRs over finite fields via semi-tensor product
This page was built for publication: Permutation polynomials and nonsingular feedback shift registers over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3476743)