Skip to main content
Conference ProceedingsOPEN ACCESS

Lower bounds for the linear complexity of sequences over residue rings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 473 LNCS 189-195
DOI: 10.1007/3-540-46877-3_16
35Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Linear feedback shift registers over the ring Z2e can be implemented efficiently on standard microprocessors. The most significant bits of the elements of a sequence in Z∞2e constitute a binary pseudo-random sequence. We derive lower bounds for the linear complexity over F2 of these binary sequences.

Cite

CITATION STYLE

APA

Dai, Z. D., Beth, T., & Gollmann, D. (1991). Lower bounds for the linear complexity of sequences over residue rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 473 LNCS, pp. 189–195). Springer Verlag. https://doi.org/10.1007/3-540-46877-3_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free