scientific article; zbMATH DE number 1996484
From MaRDI portal
Publication:4432454
zbMath1029.94024MaRDI QIDQ4432454
Publication date: 22 October 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Related Items (13)
Multisequences with high joint nonlinear complexity ⋮ Improved results on periodic multisequences with large error linear complexity ⋮ Error linear complexity measures for multisequences ⋮ A lattice-based minimal partial realization algorithm for matrix sequences of varying length ⋮ Lattice basis reduction algorithms and multi-dimensional continued fractions ⋮ Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences ⋮ Generalized Joint Linear Complexity of Linear Recurring Multisequences ⋮ A Lattice-Based Minimal Partial Realization Algorithm ⋮ Enumeration results on the joint linear complexity of multisequences ⋮ Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences ⋮ Periodic multisequences with large error linear complexity ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
This page was built for publication:
