On a Conjecture about Binary Strings Distribution

DOI10.1007/978-3-642-15874-2_30MaRDI QIDQ3588607zbMATH OpenOpenAlexFDO

Authors Jean-Pierre Flori, Sihem Mesnager, Hugues Randriam, Gérard Cohen

Publication date 8 September 2010

Published in Sequences and Their Applications – SETA 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15874-2_30

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Boolean functions (06E30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• On the distribution of runs of ones in binary strings
• Some generalizations on counting binary strings
• On the complexity of random strings
• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
• A Note on the Probability of Rectangles for Correlated Binary Strings
• scientific article; zbMATH DE number 840348
• Limit probabilities for random sparse bit strings
• On the computational power of random strings
• Block-distribution in random strings
• Joint distributions of counts of strings in finite Bernoulli sequences

Cited in

(22)

• The distribution of condition numbers of rational data of bounded bit length
• A construction of 1-resilient Boolean functions with good cryptographic properties
• On a generalised combinatorial conjecture involving addition mod \(2^k-1\)
• Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
• A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers
• On a combinatorial conjecture of Tu and Deng
• Greedy Conjecture for Strings of Length 4
• Properties of a family of cryptographic Boolean functions
• On a combinatorial conjecture
• Linear Approximations of Addition Modulo 2n-1
• On the Varshamov-Tenengolts construction on binary strings
• Boolean functions optimizing most of the cryptographic criteria
• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
• Constrained Embedding Probability for Two Binary Strings
• A lower bound for Cusick’s conjecture on the digits of n + t
• Approaching Cusick's conjecture on the sum-of-digits function
• Distribution results for low-weight binary representations for pairs of integers
• The binary digits of n+t
• The Tu-Deng conjecture holds almost surely
• Block occurrences in the binary expansion
• A combinatorial condition and Boolean functions with optimal algebraic immunity
• On the distribution of runs of ones in binary strings

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: On a Conjecture about Binary Strings Distribution

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