✦ LIBER ✦

Complexity of prime-dimensional sequences over a finite field

✍ Scribed by E. Y. Lerner

Publisher: Springer-Verlag
Year: 2008
Weight: 245 KB
Volume: 2
Category: Article
ISSN: 1991-0061
DOI: 10.1007/s11853-008-0024-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Minimum Linear Complexity of de B

On the Minimum Linear Complexity of de Bruijn Sequences over Non-prime Finite Fields

✍ Peter A. Hines 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

It has been conjectured that over any non-prime finite field F p m and for any positive integer n, there exists a span n de Bruijn sequence over F p m which has the minimum possible linear complexity p nm&1 +n. We give a proof by construction that this conjecture is true.

Finite-dimensional Lie superalgebras of

Finite-dimensional Lie superalgebras of Cartan type over fields of prime characteristic

✍ Yongzheng Zhang 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 240 KB

On the complexity of the normal bases vi

On the complexity of the normal bases via prime Gauss period over finite fields

✍ Qunying Liao; Keqin Feng 📂 Article 📅 2009 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 271 KB

On a infinite-dimensional group over a f

On a infinite-dimensional group over a finite field

✍ A. M. Vershik; S. V. Kerov 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 568 KB

On a convolution of linear recurring seq

On a convolution of linear recurring sequences over finite fields

✍ Pentti Haukkanen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Generators of Nonassociative Simple Mouf

Generators of Nonassociative Simple Moufang Loops over Finite Prime Fields

✍ Petr Vojtěchovský 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 70 KB

We present an elementary proof that the nonassociative simple Moufang loops over finite prime fields are generated by three elements. In the last section, we conclude that integral Cayley numbers of unit norm are generated multiplicatively by three elements.