Abstract
An algorithm to compute the exact degree of balancedness in the output sequence of a LFSR-based generator (either nonlinear filters or combination generators) has been developed.
Keywords
Work supported by Ministerio de Ciencia y Tecnología (Spain) under grant TIC 2001-0586.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Menezes, A.J., et al.: Handbook of Applied Cryptography. CRC Press, NY (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
García-Mochales, P., Fúster-Sabater, A. (2004). Efficient Computation of Balancedness in Binary Sequence Generators. In: Apostolico, A., Melucci, M. (eds) String Processing and Information Retrieval. SPIRE 2004. Lecture Notes in Computer Science, vol 3246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30213-1_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-30213-1_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23210-0
Online ISBN: 978-3-540-30213-1
eBook Packages: Springer Book Archive