| ??? 06/02/08 12:37 Read: times |
#155393 - math quiz of the week |
Given integers N and K, N > 2, 1 < K <= N/2, what is the maximum number of N-bit binary numbers such, that each two of them differ at least in K bits?
We came across this question when trying to construct a set of 7-bit addresses differing from each other in at least 3 bits, for extra noise immunity. Enjoy! Jan Waclawek |
| Topic | Author | Date |
| math quiz of the week | 01/01/70 00:00 | |
| Hamming distance. | 01/01/70 00:00 | |
| Do you know the answer already? | 01/01/70 00:00 | |
| I am interested in the result, of course... | 01/01/70 00:00 | |
| Here's the table: | 01/01/70 00:00 | |
| Thanks - this is what I needed originally. | 01/01/70 00:00 | |
Much better than repeating the codes. | 01/01/70 00:00 |