Linear span analysis of a set of periodic sequence generators
DOI10.1007/3-540-60693-9_5zbMATH Open1383.94008DBLPconf/ima/Caballero-GilF95OpenAlexW1843961068WikidataQ61763402 ScholiaQ61763402MaRDI QIDQ4608494FDOQ4608494
Authors: Pino Caballero-Gil, Amparo Fúster-Sabater 
Publication date: 21 March 2018
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60693-9_5
Recommendations
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algorithms in computer science (68W99)
Cites Work
- Title not available (Why is that?)
- Analysis and design of stream ciphers
- Shift-register synthesis and BCH decoding
- Title not available (Why is that?)
- Bounds on the linear span of bent sequences
- An analysis of the structure and complexity of nonlinear binary sequence generators
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- On the linear complexity of nonlinearly filtered pn-sequences
- Full period and spectral test of linear congruential generator and second-order multiple recursive generator
- A wide family of nonlinear filter functions with a large linear span
- Title not available (Why is that?)
- Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants
- Linear span of extended sequences and cascaded GMW sequences
- Title not available (Why is that?)
This page was built for publication: Linear span analysis of a set of periodic sequence generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608494)
