Enumeration results on the joint linear complexity of multisequences
DOI10.1016/J.FFA.2005.03.005zbMATH Open1156.94328OpenAlexW1975602219MaRDI QIDQ998652FDOQ998652
Authors: L.-P. Wang, Harald Niederreiter
Publication date: 9 February 2009
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2005.03.005
Recommendations
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Generalized Joint Linear Complexity of Linear Recurring Multisequences
- The expected value of the joint linear complexity of periodic multisequences
- On the Joint Linear Complexity of Linear Recurring Multisequences
- The asymptotic behavior of the joint linear complexity profile of multisequences
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- Title not available (Why is that?)
- Rational points on curves over finite fields. Theory and Applications
- Analysis and design of stream ciphers
- Construction and estimation of bases in function fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- Title not available (Why is that?)
- Progress in Cryptology - INDOCRYPT 2003
- The Probabilistic Theory of Linear Complexity
- Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
- \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
Cited In (18)
- Lattice basis reduction algorithms and multi-dimensional continued fractions
- On the Joint Linear Complexity of Linear Recurring Multisequences
- Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
- Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields
- Improved results on the probabilistic theory of the joint linear complexity of multisequences
- Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences
- Progress in Cryptology - INDOCRYPT 2003
- Enumeration results on linear complexity profiles and lattice profiles
- The asymptotic normalized linear complexity of multisequences
- Error linear complexity measures for multisequences
- Periodic multisequences with large error linear complexity
- The expectation and variance of the joint linear complexity of random periodic multisequences
- On the linear complexity of multisequences, bijections between \(\mathbb Z\)ahlen and \(\mathbb N\)umber tuples, and partitions
- Joint linear complexity of periodic multi-sequences
- Generalized Joint Linear Complexity of Linear Recurring Multisequences
This page was built for publication: Enumeration results on the joint linear complexity of multisequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998652)