214 search results - page 3 / 43 » Perfect and Almost Perfect Sequences |
99
Voted
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set S = {1, . . . , s} of linear functionals from V to F ...
107
Voted
DISOPT
2007
14 years 11 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
86
Voted
JGT
2006
14 years 11 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
107
Voted
ACNS
2006
Springer
15 years 5 months ago
2006
Springer
The visual secret sharing (VSS for short) scheme is a secret image sharing scheme. A secret image is visually revealed from overlapping shadow images without additional computation...
98
Voted
DM
2008
14 years 10 months ago
2008
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...