Problem 2244. Compute hamming distance between two binary vectors represented using lists of 1-byte numbers
Let v and u be vectors of the same size with 8-bit integers (0-255). We want to compute the number of bits where those vectors differs i.e. a Hamming distance between vectors formed by concatenation of binary representations of those numbers. For example:
v = [1 0] u = [1 255]
Binary representations:
v_bin = [00000001 00000000] u_bin = [00000001 11111111]
And the Hamming distance:
d = 0 + 8 = 8
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers39
Suggested Problems
-
Given two arrays, find the maximum overlap
1453 Solvers
-
Check to see if a Sudoku Puzzle is Solved
320 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
810 Solvers
-
Matrix multiplication across rows
315 Solvers
-
Back to basics - mean of corner elements of a matrix
405 Solvers
More from this Author4
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!