Multisequences with almost perfect linear complexity profile and function fields over finite fields
From MaRDI portal
Publication:5925969
DOI10.1006/jcom.2000.0560zbMath1026.94006OpenAlexW2001807897MaRDI QIDQ5925969
Publication date: 20 October 2002
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.2000.0560
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
Multisequences with high joint nonlinear complexity, The asymptotic behavior of the joint linear complexity profile of multisequences, The expected value of the joint linear complexity of periodic multisequences, Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields, On the joint linear complexity profile of explicit inversive multisequences, Multi-sequences with \(d\)-perfect property, Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\), 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}\), The expectation and variance of the joint linear complexity of random periodic multisequences
Cites Work
- Algebraic function fields and codes
- Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles
- Constructions of sequences with almost perfect linear complexity profile from curves over finite fields
- Linear Complexity and Random Sequences
- Sequences with almost perfect linear complexity profiles and curves over finite fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item