Constructions of sequences with almost perfect linear complexity profile from curves over finite fields

DOI10.1006/FFTA.1999.0251zbMath0943.94005OpenAlexW2078445005MaRDI QIDQ1964068

Cunsheng Ding, Harald Niederreiter, Xing, Chaoping, Kwok-Yan Lam

Publication date: 6 September 2000

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0c52ec7f1ae9f1a61a4057e27e4ad5f4a1531f22

zbMATH Keywords

algebraic curves over finite fieldslinear complexityshift-register sequence

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Finite ground fields in algebraic geometry (14G15) Random number generation in numerical analysis (65C10)

Related Items (3)

ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS ⋮ Perfect linear complexity profile and apwenian sequences ⋮ Multisequences with almost perfect linear complexity profile and function fields over finite fields

This page was built for publication: Constructions of sequences with almost perfect linear complexity profile from curves over finite fields