On the linear complexity of feedforward clock-controlled sequence
From MaRDI portal
Publication:2151314
DOI10.1007/978-3-030-88323-2_18zbMath1492.94177arXiv2108.10770OpenAlexW3210688939MaRDI QIDQ2151314
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2108.10770
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines
- Correlation properties of a general binary combiner with memory
- Generalized inverses of certain Toeplitz matrices
- On the linear complexity of nonuniformity decimated PN-sequences
- Some randomness properties of cascaded sequences (Corresp.)
- 2-Adic shift registers
This page was built for publication: On the linear complexity of feedforward clock-controlled sequence