Results 11 to 20 of about 18,476 (288)
Compressed Communication Complexity of Hamming Distance
Algorithms, 2021 We consider the communication complexity of the Hamming distance 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 ...
Shiori Mitsuya +4 more
doaj +3 more sources
On the average Hamming distance for binary codes
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fangwei Fu
exaly +2 more sources
Privacy-preserving Hamming and Edit Distance Computation and Applications [PDF]
Jisuanji kexue, 2022 With the rapid development of information technology,privacy-preserving multiparty cooperative computation is becoming more and more popular.Secure multiparty computation is a key technology to address such problems.In scientific research and practical ...
DOU Jia-wei
doaj +1 more source
Sign-Rank of k-Hamming Distance is Constant [PDF]
2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)19 pages, 6 ...
Mika Göös +3 more
openaire +4 more sources
Average Hamming distance from wild-type and average pairwise Hamming distance between sequences per round. [PDF]
, 2023 Average Hamming distance from wild-type and average pairwise Hamming distance between sequences per round.
Philip A. Romero (10789265) +4 more
core +1 more source
Variational Recommendation Algorithm Based on Differential Hamming Distance [PDF]
Jisuanji kexue, 2022 Current recommendation algorithms based on hashing technology commonly uses Hamming distance to indicate the similarity between user hash code and item hash code,while it ignores the potential difference information of each bit dimension.Therefore,this ...
DONG Jia-wei, SUN Fu-zhen, WU Xiang-shuai, WU Tian-hui, WANG Shao-qing
doaj +1 more source
On the $k$-Hamming and $k$-Edit Distances [PDF]
CoRR, 2023 In this paper we consider the weighted $k$-Hamming and $k$-Edit distances, that are natural generalizations of the classical Hamming and Edit distances. As main results of this paper we prove that for any $k\geq 2$ the DECIS-$k$-Hamming problem is $\mathbb{P}$-SPACE-complete and the DECIS-$k$-Edit problem is NEXPTIME-complete.
Chiara Epifanio +5 more
openaire +3 more sources
Approximating text-to-pattern Hamming distances [PDF]
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020 We revisit a fundamental problem in string matching: given a pattern of length m and a text of length n, both over an alphabet of size $σ$, compute the Hamming distance between the pattern and the text at every location. Several $(1+ε)$-approximation algorithms have been proposed in the literature, with running time of the form $O(ε^{-O(1)}n\log n\log ...
Timothy M. Chan +4 more
openaire +2 more sources
Hamming distance from irreducible polynomials over $\mathbb {F}_2$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general ...
Gilbert Lee +2 more
doaj +1 more source
Permutation codes over Sylow 2-subgroups $Syl_2(S_{2^n})$ of symmetric groups $S_{2^n}$
Researches in Mathematics, 2021 The permutation code (or the code) is well known object of research starting from 1970s. The code and its properties is used in different algorithmic domains such as error-correction, computer search, etc.
V.A. Olshevska
doaj +1 more source