A Lower Bound on the Expected Complexity in the Set of n-Tuples of Given Weight

DOI10.1080/02522667.1990.10699020zbMath0712.94010OpenAlexW2314778374MaRDI QIDQ3197752

Francesco Fabris

Publication date: 1990

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1990.10699020

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (1)

Periods Distribution in the Linear Feedback Generalized Registers

Cites Work

• Analysis and design of stream ciphers
• Shift-register synthesis and BCH decoding
• Generation of binary sequences with controllable complexity

This page was built for publication: A Lower Bound on the Expected Complexity in the Set of n-Tuples of Given Weight