PUZZLE #4299: IrisCode Recognition (diff 3)
Two 256-bit IrisCode vectors are provided. Compute the Hamming distance between them (fraction of differing bits). Answer is the distance as a float.
DATA
| Difficulty |
3
|
| Code1 |
0110011010111010100100000001001100101010001000110000111110000110001100100100011100011100000000000011001001101010001101111000001100001000001111000001011001100000011000001010010001100111110101100110000010111001000110010000001000000110010111011000110101000011
|
| Code2 |
0001011011101011110010011010001111011111100011100111110100010000011110111101101010010010110011000000000001110100100010000101101010111000000001011100110111111101101001110110111101010000000100110011010000101000101011110001110001101100101111101100101111110011
|
| Hint |
IrisCode Hamming distance = count_differing_bits / 256. XOR the two bit vectors and count set bits. Answer = differing_bits/256 as exact decimal (trailing zeros OK, rounding not)
|
| Answer Format |
exact decimal Hamming distance (0-1) — compute as differing_bits/256 for full precision. trailing zeros optional, rounding rejected
|
author's note: Pool fill: iris diff 3
— website sponsored —
[ ad space ]