Results 1 to 10 of about 18,476 (288)
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
The intractability of computing the Hamming distance [PDF]
Theoretical Computer Science, 2003 The Hamming distance of a string \(x\) to a language \(L\) is the minimum Hamming distance of \(x\) to any string in \(L\). The paper presents a number of results on the complexity of computing the Hamming distance. Namely, there exist a language in AC\(^0\) such that both Hamming distance and edit distance to this language are hard to approximate ...
Manthey, Bodo, Reischuk, Rüdiger
core +5 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 +7 more sources
Hamming distance for conjugates [PDF]
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.
Shallit, Jeffrey
openaire +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
The communication complexity of the Hamming distance problem [PDF]
Information Processing Letters, 2006 We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two n-bit strings is no less than a threshold d. We prove a quantum lower bound of Ω(d) qubits in the general interactive model with shared prior entanglement.
Yaoyun Shi
exaly +4 more sources
CoRRIn this paper, we present and study the \emph{Hamming distance oracle problem}. In this problem, the task is to preprocess two strings $S$ and $T$ of lengths $n$ and $m$, respectively, to obtain a data-structure that is able to answer queries regarding the Hamming distance between a substring of $S$ and a substring of $T$. For a constant size alphabet
Itai Boneh +3 more
openaire +3 more sources
The Information Complexity of Hamming Distance. [PDF]
, 2014 The Hamming distance function Ham_{n,d} returns 1 on all pairs of inputs x and y that differ in at most d coordinates and returns 0 otherwise. We initiate the study of the information complexity of the Hamming distance function. We give a new optimal lower bound for the information complexity of the Ham_{n,d} function in the small-error regime where ...
Blais, Eric, Brody, Joshua, Ghazi, Badih
openaire +5 more sources