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

DOI10.1080/02522667.1990.10699020MaRDI QIDQ3197752zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1564048
• scientific article; zbMATH DE number 4191553
• On the multiplicative complexity of binary words with a given number of units.
• scientific article; zbMATH DE number 3885787
• On the average-case complexity of Boolean functions under binomial distribution on their domains

Cites work

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

Cited in

(1)

• Periods Distribution in the Linear Feedback Generalized Registers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197752)