hamming-distance Questions
10
Solved
For a Data Structures project, I must find the shortest path between two words (like "cat" and "dog"), changing only one letter at a time. We are given a Scrabble word list to use in finding our pa...
Usurpation asked 5/10, 2009 at 19:32
4
Find twelve 32-bit numbers such that each pair of them differs by bits in at least 17 positions.
I'm struggling to find and optimal algorithm for this problem. More general question is:
Find 'n' 32...
Yorke asked 24/5, 2023 at 8:49
3
I trying to improve search similar images pHashed in MySQL database.
Right now I comparing pHash counting hamming distance like this:
SELECT * FROM images WHERE BIT_COUNT(hash ^ 202835905253510827...
Underpin asked 17/2, 2013 at 19:30
3
Solved
We are in the process of migrating a MySQL 5.7 database to PostgreSQL 9.6.
A real issue is the lack of bit_count function in PostgreSQL. This function is also not available in the upcoming version...
Disquisition asked 18/9, 2017 at 13:36
3
I tried to find out how to calculate the error detection capabilities of arbitrary CRC polynomials.
I know that there are various error detection capabilities that may (or may not) apply to an arb...
Keene asked 19/8, 2016 at 22:10
5
Solved
I have two numpy arrays of the same length that contain binary values
import numpy as np
a=np.array([1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0])
b=np.array([1, 1, 1, 1, 0, 1, 1...
Selfappointed asked 23/9, 2015 at 2:51
7
Solved
Problem:
Given a large (~100 million) list of unsigned 32-bit integers, an unsigned 32-bit integer input value, and a maximum Hamming Distance, return all list members that are within the specifie...
Fungosity asked 17/6, 2011 at 18:1
7
Similar image search problem
Millions of images pHash'ed and stored in Elasticsearch.
Format is "11001101...11" (length 64), but can be changed (better not).
Given subject image's hash "100111....
Saxony asked 25/9, 2015 at 15:37
3
i'm just learning python 3 now.
'''It's ask the user for two string and find the Hamming distance between the strings.Input sequences should only include nucleotides ‘A’, ’T’, ‘G’ and ‘C’. Program ...
Incurrent asked 15/2, 2018 at 4:28
3
Solved
I have a set of bitstrings: {'0011', '1100', '1110'} (all bitstrings within a set are of same length).
I want to quickly find the bitstring of same length that has the smallest max-similarity to t...
Achromic asked 7/4, 2019 at 0:16
2
Solved
For the problem I'm working on, finding distances between two sequences to determine their similarity, sequence order is very important. However, the sequences that I have are not all the same leng...
Lection asked 3/1, 2011 at 21:29
3
Solved
I'm attempting to calculate the Hamming distance between an input hash and database-stored hashes. These are perceptual hashes, so the Hamming distance between them are important to me and tell me ...
Preachy asked 2/2, 2019 at 20:45
4
Solved
I have a list of possibilities and a desired input:
possibles = [20, 30, 40, 50, 60, 70, 80, 100]
desired = [20, 30, 40]
I want to generate the close by lists. Example:
# Distance of 1 (i.e. 1 ...
Fletcher asked 2/7, 2018 at 9:1
3
Solved
I am tasked with calculating hamming distances between 1D binary arrays in two groups - a group of 3000 arrays and a group of 10000 arrays, and every array is 100 items(bits) long. So thats 3000x10...
Exhibitionist asked 31/5, 2018 at 1:3
3
Consider the set, S, of all binary vectors of length n where each contains exactly m ones; so there are n-m zeros in each vector.
My goal is to construct a number, k, of vectors from S such that t...
Aerometry asked 11/5, 2018 at 12:37
2
Solved
Hamming Distance:
For example, two binary number: 1011 and 1000's HD(Hamming distance) is 2.
The 10000 and 01111's HD is 5.
Here is the code:
Can some one explain it to me?
Thanks!
short Hamm...
Algol asked 18/3, 2014 at 12:34
2
If you have n binary strings, each of length m, is there a faster way to determine the minimum Hamming distance between any pair than to compare all O(n^2) pairs and for each to compute their Hammi...
Selfknowledge asked 14/4, 2018 at 9:16
5
Solved
Vectors like this
v1 = {0 0 0 1 1 0 0 1 0 1 1}
v2 = {0 1 1 1 1 1 0 1 0 1 0}
v3 = {0 0 0 0 0 0 0 0 0 0 1}
Need to calculate similarity between them. Hamming distance between v1 and v2 is 4 and b...
Guinna asked 11/5, 2013 at 11:29
4
Solved
I found an interesting algorithm to calculate hamming distance on this site:
def hamming2(x,y):
"""Calculate the Hamming distance between two bit strings"""
assert len(x) == len(y)
count,z = 0...
Melbourne asked 23/6, 2015 at 15:28
3
Solved
I have a process, similar to tineye that generates perceptual hashes, these are 32bit ints.
I intend to store these in a sql database (maybe a nosql db) in the future
However, I'm stumped at how ...
Toodleoo asked 7/3, 2012 at 17:42
4
Solved
In ruby, what is the most efficient way to calculate the bit difference between two unsigned integers (e.g. the hamming distance)?
Eg, I have integer a = 2323409845 and b = 1782647144.
Their bin...
Landahl asked 18/6, 2011 at 9:45
2
Solved
beginner with Python here. So I'm having trouble trying to calculate the resulting binary pairwise hammington distance matrix between the rows of an input matrix using only the numpy library. I'm s...
Satiable asked 12/3, 2017 at 20:18
3
Solved
I have two data frames, df1 with reference data and df2 with new data. For each row in df2, I need to find the best (and the second best) matching row to df1 in terms of hamming distance.
I used e...
Sleep asked 20/6, 2016 at 1:9
4
Solved
Let a and b be vectors of the same size with 8-bit integers (0-255). I want to compute the number of bits where those vectors differs i.e. a Hamming distance between vectors formed by concatenation...
Nels asked 29/11, 2016 at 20:34
4
Solved
Given a vector of bits v, compute the collection of bits that have Hamming distance 1 with v, then with distance 2, up to an input parameter t.
So for
011 I should get
~~~
111
001
010
~~~ -> ...
Enthrone asked 25/11, 2016 at 22:37
1 Next >
© 2022 - 2024 — McMap. All rights reserved.