A note on the crosscorrelation of maximal length FCSR sequences
From MaRDI portal
Publication:1009127
DOI10.1007/S10623-008-9238-YzbMath1196.94040OpenAlexW2069071655MaRDI QIDQ1009127
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9238-y
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Congruences; primitive roots; residue systems (11A07)
Cites Work
- Unnamed Item
- Binary sequences derived from ML-sequences over rings. I: Periods and minimal polynomials
- Feedback shift registers, 2-adic span, and combiners with memory
- Compression Mappings on Primitive Sequences Over<tex>$Z/(p^e)$</tex>
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- 2-Adic shift registers
- A lower bound on the linear span of an FCSR
- Partial period distribution of FCSR sequences
- Autocorrelations of Maximum Period FCSR Sequences
This page was built for publication: A note on the crosscorrelation of maximal length FCSR sequences