Compressed Communication Complexity of Hamming Distance

Compressed Communication Complexity of Hamming Distance

We consider the communication complexity of the <i>Hamming distance</i> of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a compressed form, i.e., represe...

Full description

Bibliographic Details
Main Authors: Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Format: Article
Language:English
Published: MDPI AG 2021-04-01
Series:Algorithms
Subjects:
communication complexity
Hamming distance
Lempel-Ziv compression
Online Access:https://www.mdpi.com/1999-4893/14/4/116

Internet

https://www.mdpi.com/1999-4893/14/4/116

Similar Items