15 search results - page 1 / 3 » New Constructions of Distance-Increasing Mappings and Permut... |
JISE
2007
13 years 9 months ago
2007
CPM
2009
Springer
13 years 7 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
ISSAC
1994
Springer
14 years 1 months ago
1994
Springer
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
IJNSEC
2006
13 years 9 months ago
2006
The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restri...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the p...