Pages that link to "Item:Q3588607"
From MaRDI portal
The following pages link to On a Conjecture about Binary Strings Distribution (Q3588607):
Displaying 21 items.
- On the Varshamov-Tenengolts construction on binary strings (Q393366) (← links)
- Boolean functions optimizing most of the cryptographic criteria (Q412332) (← links)
- Distribution results for low-weight binary representations for pairs of integers (Q596061) (← links)
- The Tu-Deng conjecture holds almost surely (Q668088) (← links)
- A combinatorial condition and Boolean functions with optimal algebraic immunity (Q904950) (← links)
- On the distribution of runs of ones in binary strings (Q979847) (← links)
- The distribution of condition numbers of rational data of bounded bit length (Q1601362) (← links)
- A construction of 1-resilient Boolean functions with good cryptographic properties (Q1621194) (← links)
- On a generalised combinatorial conjecture involving addition mod \(2^k-1\) (Q1664081) (← links)
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity (Q2440096) (← links)
- A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers (Q2510577) (← links)
- On a combinatorial conjecture of Tu and Deng (Q2855547) (← links)
- Greedy Conjecture for Strings of Length 4 (Q2942268) (← links)
- Properties of a Family of Cryptographic Boolean Functions (Q2945065) (← links)
- On a Combinatorial Conjecture (Q2999536) (← links)
- Linear Approximations of Addition Modulo 2n-1 (Q3013094) (← links)
- Expected Number of Distinct Subsequences in Randomly Generated Binary Strings (Q4560193) (← links)
- Constrained Embedding Probability for Two Binary Strings (Q4895627) (← links)
- A lower bound for Cusick’s conjecture on the digits of <i>n</i> + <i>t</i> (Q5019791) (← links)
- Approaching Cusick's conjecture on the sum-of-digits function (Q5244187) (← links)
- The binary digits of n+t (Q6098863) (← links)