Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields
From MaRDI portal
Publication:439096
DOI10.1016/j.ffa.2012.05.005zbMath1277.94038OpenAlexW2073404114MaRDI QIDQ439096
Publication date: 1 August 2012
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2012.05.005
automorphismsmultisequences\(k\)-error linear complexityArtin-Schreier extensions of function fieldsjoint linear complexity
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Cites Work
- Unnamed Item
- Algebraic function fields and codes
- Error linear complexity measures for multisequences
- Enumeration results on the joint linear complexity of multisequences
- Periodic multisequences with large error linear complexity
- The stability theory of stream ciphers
- The expected value of the joint linear complexity of periodic multisequences
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- The expectation and variance of the joint linear complexity of random periodic multisequences
- On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields
- An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps
- Multisequences With Large Linear and $k$-Error Linear Complexity From Hermitian Function Fields
- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
- Multisequences with almost perfect linear complexity profile and function fields over finite fields
