50 search results - page 3 / 10 » Construction of expanders and superconcentrators using Kolmo... |
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
ECCC
2000
13 years 5 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...