28 search results - page 3 / 6 » dcc 2011 |
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
For odd integer m ≥ 3 and t = 0, 1, . . . , m−1 2 , we define Family V (t) to be a set of size 2m(t+1) containing binary sequences of period 2m+1 − 2. The nontrivial correl...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
DCC
2011
IEEE
13 years 1 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...