Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Public vs. private coin flips in one round communication games (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Sperner theory
Communication complexity
On the power of quantum fingerprinting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Distributed construction of quantum fingerprints
Quantum Information & Computation
Classical and quantum fingerprinting with shared randomness and one-sided error
Quantum Information & Computation
Upper bounds for constant-weight codes
IEEE Transactions on Information Theory
Achieving the Welch bound with difference sets
IEEE Transactions on Information Theory
On Weyl-Heisenberg orbits of equiangular lines
Journal of Algebraic Combinatorics: An International Journal
| Hi-index | 0.00 |
Fingerprinting enables two parties to infer whether the messages they hold are the same or different when the cost of communication is high: each message is associated with a smaller fingerprint and comparisons between messages are made in terms of their fingerprints alone. In the simultaneous message passing model, it is known that fingerprints composed of quantum information can be made exponentially smaller than those composed of classical information. For small message lengths, we present constructions of optimal classical fingerprinting strategies with one-sided error, in both the one-way and simultaneous message passing models, and provide bounds on the worst-case error probability with the help of extremal set theory. The performance of these protocols is then compared to that for quantum fingerprinting strategies constructed from spherical codes, equiangular tight frames and mutually unbiased bases.