Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences
DOI10.1016/J.DAM.2016.04.004zbMATH Open1349.94118OpenAlexW2346126790WikidataQ123010245 ScholiaQ123010245MaRDI QIDQ335355FDOQ335355
Authors: Qichun Wang, Chik How Tan 
Publication date: 2 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.004
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^n\)-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}\)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Application of orthogonal and other special functions (94A11)
Cites Work
- Title not available (Why is that?)
- Distribution Properties of Half-$$\ell $$-Sequence
- Modular Forms
- Title not available (Why is that?)
- Design of test sequences for VLSI self-testing using LFSR
- On the Number of Linear Feedback Shift Registers With a Special Structure
- Revisiting LFSRs for Cryptographic Applications
- Periodic Binary Sequences: Solved and Unsolved Problems
- Correlation theorems in cryptanalysis
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)
