𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructions of authentication codes from algebraic curves over finite fields

✍ Scribed by Chaoping Xing; Huaxiong Wang; Kwok Yan Lam

Book ID
114541569
Publisher
IEEE
Year
2000
Tongue
English
Weight
176 KB
Volume
46
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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,

Constructions of Sequences with Almost P
Constructions of Sequences with Almost Perfect Linear Complexity Profile from Curves over Finite Fields
✍ Chaoping Xing; Harald Niederreiter; Kwok Yan Lam; Cunsheng Ding πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 118 KB

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 cons