Compressed Communication Complexity of Hamming Distance

We consider the communication complexity of Hamming distance two strings. Bille et al. [SPIRE 2018] considered longest common prefix (LCP) problem in setting where parties have their strings a compressed form, i.e., represented by Lempel-Ziv 77 factorization (LZ77) with/without self-references. present randomized public-coin protocol for joint computation LZ77 without Although our scheme is heavily based on al.’s LCP protocol, analysis original which uses Crochemore’s C-factorization and Rytter’s AVL-grammar. As byproduct, we also show that self-references are not monotonic sense sizes can increase factor 4/3 when string removed.