## hamming-distance - Question

• ### Hamming distance for grouped results

``````
I'm working with a data set that contains 40 different participants, with each 30 observations.
As I am observing search behavior, I want to calculate the search distance for each subject per round (...
``````

• ### How to efficiently compute hamming distances with Vulkan

``````
What is an efficient way to calculate hamming distances/popcounts between bit strings (assume 32 or 64 bit integer pointers) on the GPU with the Vulkan API. From what I've seen there is no intrinsic ...
``````

• ### How do you write a code to solve this issue? [closed]

``````
given a binary code with minimum distance,where's a positive integer,write a program that will detect errors in codewords in as many as−1 positions and correct errors in as many as?(k−1)/2?positions.
...
``````

• ### Tighter bound on the VC-dimention of Hamming distances k-means

``````
Given an array of strings of d bits called G and an integer k.

For any array of size k of strings of d bits A and a non-negative number r we define:

range(A, r) = {h(G, A) <= r, h(G, A) <...
``````

• ### Stability of features selection using Jaccard Index

``````
If I have a dataset A with 20 features, and I applied feature selection algorithm which selected 5 features i.e. 1,2,5,9, 13

Then I made changes in data (i.e. removed outliers) and again applied ...
``````

• ### pairwise hamming distance between numpy arrays considering non-zero values only

``````
I want to calculate the pairwise hamming distance of a 2D numpy array.

My arrays is

A
array([[-1,  0, -1,  0, -1,  0],
[ 1,  0,  0,  0,  0,  0],
[ 0,  0,  1,  1,  1,  0],
[ 0,  ...
``````

• ### How to show if ISBN code can self-repair by Hamming distance?

``````
I found this filled college worksheet. It states that minimum (Hamming) distance of ISBN code is 2 (Excercise 5). I know how to prove this and why is that. But then in excercise 8 it states that ISBN ...
``````

• ### How to implement differentiable hamming loss in pytorch?

``````
How to implement a differentiable loss function that counts the number of wrong predictions?

output = [1,0,4,10]
target = [1,2,4,15]
loss = np.count_nonzero(output != target) / len(output) # [0,1,0,1]...
``````

• ### How do I tell that whether a code word is valid?

``````
Consider a parity check code with three data bits and four parity check bits. Three of the code words are 0101011, 1001101 and 1110001. Which of the following are also code words?
I. 0010111
II. ...
``````

• ### Plot probability mass function of fractional hamming distance using Python

``````
I would like to plot the pmf of a list of fractional hamming distance values (a list of numbers between 0 - 1). The following code shows what I did:

import seaborn as sns
import matplotlib.pyplot as ...
``````

• ### low-memory pseudo-random shuffle for fixed arbitrary length array

``````
Context: I'm writing an external SRAM tester for a microcontroller-based embedded system. No security, no cryptography involved. For reproducible  access to "as-non-consecutive-as-possible" memory ...
``````

• ### Why (inter hamming distance) / (intra hamming distance) emphasize in physically unclonable function(PUF)?

``````

I know intra hamming distance(hamming distance among repeatably measured chip ID) and inter hamming distance(hamming distance among chip ...
``````

• ### Find the Hamming distance between string sequences

``````
I have a dataset of 3156 DNA sequences, each of which has 98290 characters (SNPs), comprising the (usual) 5 symbols : A, C, G, T, N (gap).

What is the optimal way to find the pairwise Hamming ...
``````

• ### How many Bits can be corrected - SECDED Code Words

``````
if each of the 3 Code-Words below were created using SECDED (bit 0 checks Parity of whole Code-Word and bits 1,2,4,8,16 are Hamming-Code Parity-Bits) with even Parity.

A 010110011101110010
B ...
``````

• ### Sum of all Hamming distances of a given string A from substrings of length |A| of another string B

``````
Given two binary strings a and b, find the sum of the Hamming distances between a and all contiguous substrings of b of length |a|.

inputCopy:
01

00111
outputCopy:
3
Explanation: For the ...
``````