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...
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: | |
Online Access: | https://www.mdpi.com/1999-4893/14/4/116 |
Similar Items
-
Distance-Based Lempel–Ziv Complexity for the Analysis of Electroencephalograms in Patients with Alzheimer’s Disease
by: Samantha Simons, et al.
Published: (2017-03-01) -
On the Randomness of Compressed Data
by: Shmuel T. Klein, et al.
Published: (2020-04-01) -
Contributions to arithmetic complexity and compression
by: Lagarde, Guillaume
Published: (2018) -
Novel Error Detection Algorithm for LZSS Compressed Data
by: Beom Kwon, et al.
Published: (2017-01-01) -
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
by: Dominik Köppl
Published: (2021-01-01)