The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields
From MaRDI portal
Publication:1667457
DOI10.1007/S12095-017-0273-2zbMath1419.94023arXiv1612.07928OpenAlexW3101619623MaRDI QIDQ1667457
Zuling Chang, Huaxiong Wang, Martianus Frederic Ezerman, San Ling
Publication date: 28 August 2018
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.07928
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- De Bruijn sequences, irreducible codes and cyclotomy
- Shift Register Sequences – A Retrospective Account
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
This page was built for publication: The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields