hamming-distance
Fast computation of pairs with least hamming distance
Problem Suppose you have N (~100k-1m) integers/bitstrings each K (e.g. 256) bits long. The algorithm should return the k pairs wi开发者_开发知识库th the lowest pairwise Hamming distance.[详细]
2023-03-28 08:46 分类:问答Storing and indexing binary strings in a database
A binary string as defined here is fixed size \"array\" of bits. I call them strings since there is no order on them (sorting/indexing them as numbers has no meaning), each bit is independent of the o[详细]
2023-03-18 16:01 分类:问答Efficiently find binary strings with low Hamming distance in large set
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 specified H[详细]
2023-03-14 04:19 分类:问答Most efficient way to calculate hamming distance in ruby?
In ruby, what is the most efficient way to calculate the bit difference between two unsigned integers (e.g. the hamming distance)?[详细]
2023-03-13 16:41 分类:问答computing permutation of specific bits in a number
As part of my master thesis, I get a number (e.g. 5 bits) with 2 significant bits (2nd and 4th). This means for example x1x0x, where $x \\in {0,1}$ (x coul开发者_运维问答d be 0 or 1) and 1,0 are bits[详细]
2023-02-12 22:40 分类:问答Hamming Distance vs. Levenshtein Distance
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 length[详细]
2023-02-02 12:11 分类:问答Calculate Hamming distance between two strings of binary digits in Matlab
I have two equal length strings containing 1\'s and 0\'s. Each string is 128-bits long, and I want to calculate the Hamming distance between them. What\'s the best way I can go about doin开发者_如何学[详细]
2023-01-24 20:12 分类:问答Algorithm/approximation for combined independent set/hamming distance
Input: Graph G Output: several independent sets, so that the membership of a node to all independent sets is unique. A node therefore has no connections to any node in its own set. Here is an example[详细]
2023-01-11 22:08 分类:问答Algorithm for generating a size k error-correcting code on n bits
I want to generate a code on n bits for k different inputs that I want to classify. The main requirement of this code is the error-correcting criteria: that the minimum pairwise distance between any t[详细]
2023-01-06 11:33 分类:问答Hamming distance and error detection/correction properties
Let\'s assume I want to have a possibility of detecting 4-bit errors and recovering 2-bit errors. What the Hamming distan开发者_如何学运维ce should be then?[详细]
2023-01-05 03:52 分类:问答