All Questions
Tagged with combinatorics-on-words algorithms
1 question with no upvoted or accepted answers
1
vote
0
answers
169
views
A function $g : \{0,1\}^m \to \{0,1\}^{4m}$ such that the “circular discrepancy” between $g(x_1)$ and $g(x_2)$ is $\geq m$ for any $x_1 \neq x_2$
In this question, the term “word” implies a binary word, i.e. a sequence of bits.
Let $W(x)$ denote the number of non-zero bits in a word $x$.
Assuming that $x$ is an $s$-bit word and $0 \le k < s$,...
- 959