Multisequences with large linear and k-error linear complexity from a tower of Artin-Schreier extensions of function fields
DOI10.1016/J.FFA.2012.05.005zbMATH Open1277.94038OpenAlexW2073404114MaRDI QIDQ439096FDOQ439096
Authors: Hongxi Tong 
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
Recommendations
- On the \(k\)-error linear complexity of sequences from function fields
- Improved results on periodic multisequences with large error linear complexity
- Periodic multisequences with large error linear complexity
- Multi-sequences with large generalized joint linear complexity from algebraic curves
- An approximation algorithm for computing the extension field \(k\)-error \(\mathbb F_q\)-linear complexity of multisequences
automorphismsmultisequences\(k\)-error linear complexityArtin-Schreier extensions of function fieldsjoint linear complexity
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- The expectation and variance of the joint linear complexity of random periodic multisequences
- Algebraic function fields and codes
- The stability theory of stream ciphers
- Periodic multisequences with large error linear complexity
- Multisequences With Large Linear and $k$-Error Linear Complexity From Hermitian Function Fields
- Multisequences with almost perfect linear complexity profile and function fields over finite fields
- Error linear complexity measures for multisequences
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- The expected value of the joint linear complexity of periodic multisequences
- Title not available (Why is that?)
- An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps
- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
- Enumeration results on the joint linear complexity of multisequences
Cited In (4)
- An approximation algorithm for computing the extension field \(k\)-error \(\mathbb F_q\)-linear complexity of multisequences
- Multisequences with almost perfect linear complexity profile and function fields over finite fields
- On the linear complexity of multisequences, bijections between \(\mathbb Z\)ahlen and \(\mathbb N\)umber tuples, and partitions
- On the \(k\)-error linear complexity of sequences from function fields
This page was built for publication: Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439096)
