A309833 Maximum length of a binary sequence S such that any pair of distinct subwords of length n in S is of Hamming distance at least 3.
4, 5, 7, 12, 20, 25, 39, 71
Offset: 3
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
Yeow Meng Chee has authored 4 sequences.
For n = 5, one can choose at most a(5) = 4 codewords at edit distance at least 3 from each other. One choice of 4 such codewords is 00110, 01001, 10000, and 11111. - _Pontus von Brömssen_, Dec 05 2018
Comments