Downloads provided by UsageCounts
handle: 10261/2249
Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences to guarantee a minimum linear complexity.
Peer reviewed
Sucesiones numéricas, Criptografía, Análisis lineal, Función aleatoria, Predicción estadística, Complejidad de problemas
Sucesiones numéricas, Criptografía, Análisis lineal, Función aleatoria, Predicción estadística, Complejidad de problemas
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 36 | |
| downloads | 63 |

Views provided by UsageCounts
Downloads provided by UsageCounts