Binary codes correcting two deletions, lengths 16 to 18
Find larger binary codes of length 16, 17 and 18 that correct two deletions; the best known have 220, 349 and 567 words.
| 1 | WEBVTT |
| 2 | |
| 3 | 00:00:00.600 --> 00:00:06.395 line:0 |
| 4 | A string of 17 zeros and ones loses any two bits in transit; 15 are left. |
| 5 | |
| 6 | 00:00:07.800 --> 00:00:12.528 line:0 |
| 7 | Choose codewords that can still be told apart after any two bits are lost. |
| 8 | |
| 9 | 00:00:13.028 --> 00:00:19.589 line:0 |
| 10 | This codeword can lose two bits in 136 ways, making only 34 different strings. |
| 11 | |
| 12 | 00:00:20.089 --> 00:00:27.179 line:0 |
| 13 | Another word's 35 share none with them: the two can sit in one code. |
| 14 | |
| 15 | 00:00:29.067 --> 00:00:36.290 line:0 |
| 16 | For length 17 the most known is 349 codewords, from a paper this June. |
| 17 | |
| 18 | 00:00:36.790 --> 00:00:44.233 line:0 |
| 19 | The same paper puts the ceiling at 862: how many can really be chosen, nobody knows. |
