Results 1 to 10 of about 13,921 (252)
Hamming Distance Optimized Underwater Acoustic OTFS-IM Systems [PDF]
Entropy, 2023 The orthogonal time frequency space (OTFS) modulation technique can provide reliable communication in time-varying channels. Due to the dispersive characteristics of underwater acoustic channels, this paper proposes an OTFS-IM underwater acoustic ...
Xiaopeng Guo +4 more
doaj +4 more sources
Alpha-Beta Hybrid Quantum Associative Memory Using Hamming Distance [PDF]
Entropy, 2022 This work presents a quantum associative memory (Alpha-Beta HQAM) that uses the Hamming distance for pattern recovery. The proposal combines the Alpha-Beta associative memory, which reduces the dimensionality of patterns, with a quantum subroutine to ...
Angeles Alejandra Sánchez-Manilla +2 more
doaj +2 more sources
Hamming distance for conjugates
Discrete Mathematics, 2009 Let x, y be strings of equal length. The Hamming distance h(x,y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x,y), the Hamming distance between the conjugates xy and yx.
Jeffrey Shallit
exaly +4 more sources
Communication Complexity of Computing the Hamming Distance [PDF]
SIAM Journal on Computing, 1986 Let \(x,y\in \{0,1\}^ n\). Persons A and B are given x and y respectively. They communicate in order that both find the Hamming distance \(d^ n_ H(x,y)\). Three communication models, viz, deterministic, \(\epsilon\)-error and \(\epsilon\)-randomized, are considered.
Abbas El Gamal
exaly +2 more sources
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
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
Approximate Hamming distance in a stream [PDF]
CoRR, 2016 We consider the problem of computing a $(1+ε)$-approximation of the Hamming distance between a pattern of length $n$ and successive substrings of a stream. We first look at the one-way randomised communication complexity of this problem, giving Alice the first half of the stream and Bob the second half.
Raphaël Clifford, Tatiana Starikovskaya
openaire +4 more sources