Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences
From MaRDI portal
(Redirected from Publication:335355)
Recommendations
- On linear dependencies in subspaces of LFSR-generated sequences
- Upper bounds on the imbalance of discrete functions implemented by sequences of finite automata
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
- Lower bounds on error complexity measures for periodic LFSR and FCSR sequences
- The 2-adic complexity of a class of LFSR sequence families
- A construction ofp-ary balanced sequence with largek-error linear complexity
- On the 2-error linear complexity of 2ⁿ-periodic balanced binary sequences
- The Most Significant Bit of Maximum-Length Sequences Over<tex>$BBZ_2^l$</tex>: Autocorrelation and Imbalance
- Linear complexity for a class of balanced binary sequences of period \(p^{m+1}q^{n+1}\)
Cites work
- scientific article; zbMATH DE number 3968699 (Why is no real title available?)
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- Correlation theorems in cryptanalysis
- Design of test sequences for VLSI self-testing using LFSR
- Distribution properties of half- -sequence
- Modular Forms
- On the Number of Linear Feedback Shift Registers With a Special Structure
- Periodic Binary Sequences: Solved and Unsolved Problems
- Revisiting LFSRs for Cryptographic Applications
Cited in
(2)
This page was built for publication: Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335355)