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
Solve

Solution Stats

142 Solutions

41 Solvers

Last Solution submitted on Dec 07, 2025

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers41

George Berken David Hill Christian Schröder shinya matsumoto

Suggested Problems

More from this Author4

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!