A new lower bound on the family complexity of Legendre sequences

In this paper we study a family of Legendre sequences and its pseudo-randomness in terms of their family complexity. We present an improved lower bound on the family complexity of a family based on the Legendre symbol of polynomials over a finite field. The new bound depends on the Lambert W functio...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applicable algebra in engineering, communication and computing communication and computing, 2022-03, Vol.33 (2), p.173-192
Hauptverfasser:	Çakıroğlu, Yağmur, Yayla, Oğuz
Format:	Artikel
Sprache:	eng
Schlagworte:	Artificial Intelligence Complexity Computer Hardware Computer Science Fields (mathematics) Lower bounds Original Paper Polynomials Symbolic and Algebraic Manipulation Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!