Autor:	F. Montoya Vitini, J. Monoz Masque, A. Peinado Dominguez
Rok vydání:	1998
Předmět:	Discrete mathematics Pseudorandom number generator Combinatorics Range (mathematics) Linear complexity Binary number Electrical and Electronic Engineering Upper and lower bounds Mathematics Generator (mathematics)
Zdroj:	Electronics Letters. 34:450
ISSN:	0013-5194
DOI:	10.1049/el:19980349
Popis:	Pseudorandom sequences produced by the Blum-Blum-Shub generator are seen to be useful in a wide range of applications. Recently, much attention has been paid to their linear complexity. The authors present a lower bound on the linear complexity for binary BBS sequences of maximal period.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::d10bd00239e963302eb8eefc373671d2 https://doi.org/10.1049/el:19980349 Zobrazit plný text záznamu