20 search results - page 3 / 4 » A random construction for permutation codes and the covering... |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
HPDC
2008
IEEE
13 years 5 months ago
2008
IEEE
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...
CORR
2008
Springer
2008
Springer
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
13 years 5 months ago
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
FOCS
2007
IEEE
13 years 12 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
IJNSEC
2007
13 years 5 months ago
2007
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...