✦ LIBER ✦

Constructions of Sequences with Almost Perfect Linear Complexity Profile from Curves over Finite Fields

✍ Scribed by Chaoping Xing; Harald Niederreiter; Kwok Yan Lam; Cunsheng Ding

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 118 KB
Volume: 5
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1999.0251

No coin nor oath required. For personal study only.

✦ Synopsis

Sequences with almost perfect linear complexity pro"le are of importance for the linear complexity theory of sequences. In this paper we present several constructions of sequences with almost perfect linear complexity pro"le based on algebraic curves over "nite "elds. Moreover, some interesting consequences and examples are derived from our constructions.

📜 SIMILAR VOLUMES

Multi-sequences with Almost Perfect Line

Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields

✍ Chaoping Xing 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 147 KB

Explicit Constructions of Perfect Hash F

Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields

✍ Huaxiong Wang; Chaoping Xing 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Let A be a set of order n and B be a set of order m. An (n, m, w)-perfect hash family is a set H of functions from A to B such that for any X A with |X |=w, there exists an element h # H such that h is one-to-one when restricted to X. Perfect hash families have many applications to computer science,