PUZZLE #3067: IrisCode Recognition (diff 1)
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 |
1
|
| Code1 |
0111100101101000000100101010111111011011010010100010111010010001000011100101010010000111000110010101011100100011000111110100100010001110101010011100100110001110111100010010000010011111111000101110011110000011100111000011011001100110010100101001110101111110
|
| Code2 |
1101111011111011100001011100000010011001101010000000001011111000110000000100101100111110101011101001110100010100100110010100110000001011000110111111100101101010011001101110110101100100001011101110101010111101110010011000011001010101101111001000011000011110
|
| 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 1
— website sponsored —
[ ad space ]