Publication | Closed Access
Separating Partition Systems and Locally Different Sequences
47
Citations
7
References
1988
Year
Initial ResultsEngineeringPerfect HashingPartition SystemsPartition (Database)Partition Systemscode DistanceComputational ComplexityHash FunctionVariable-length CodeComputer ScienceDiscrete MathematicsSymbolic DynamicCombinatorial OptimizationPerceptual HashingDiscrete Integrable SystemCryptography
The problem of perfect hashing is generalized and some initial results are obtained. As a corollary, an improvement on earlier results for $( i, j )$-separating systems of partitions is provided.MSC codesO5B40O5A1594A10MSC codesseparating partition systemscode distance
| Year | Citations | |
|---|---|---|
Page 1
Page 1