Sciweavers

553 search results - page 1 / 111
» Perfect difference sets constructed from Sidon sets
Sort
View
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 8 months ago
Perfect difference sets constructed from Sidon sets
Javier Cilleruelo, Melvyn B. Nathanson
IMA
2009
Springer
145views Cryptology» more  IMA 2009»
14 years 3 months ago
On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions
Let f : F n 2 → F n 2 be an almost perfect nonlinear function (APN). The set Df := {(a, b) : f(x + a) − f(x) = b has two solutions} can be used to distinguish APN functions up ...
Yves Edel, Alexander Pott
CIKM
2007
Springer
14 years 2 months ago
External perfect hashing for very large key sets
We present a simple and efficient external perfect hashing scheme (referred to as EPH algorithm) for very large static key sets. We use a number of techniques from the literature ...
Fabiano C. Botelho, Nivio Ziviani
DCC
2008
IEEE
14 years 8 months ago
Explicit constructions for perfect hash families
Let k, v, t be integers such that k v t 2. A perfect hash family PHF(N; k, v, t) can be defined as an N ? k array with entries from a set of v symbols such that every N ?t suba...
Sosina Martirosyan, Tran van Trung
CADE
2006
Springer
14 years 8 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski