Cody

Problem 2244. Compute hamming distance between two binary vectors represented using lists of 1-byte numbers

Solution 1173448

Submitted on 27 Apr 2017 by H M Dipu Kabir
  • Size: 11
  • This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
u = 0; v = 0; y_correct = 0; assert(isequal(vHamming(u, v),y_correct))

ans = []

2   Pass
u = 0; v = 127; y_correct = 7; assert(isequal(vHamming(u, v),y_correct))

ans = []

3   Pass
u = [1 0]; v = [1 255]; y_correct = 8; assert(isequal(vHamming(u, v),y_correct))

ans = []

4   Pass
u = [0 1]; v = [255 0]; y_correct = 9; assert(isequal(vHamming(u, v),y_correct))

ans = []

5   Pass
u = [0 128]; v = [128 0]; y_correct = 2; assert(isequal(vHamming(u, v),y_correct))

ans = []

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!