| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656453 | Journal of Combinatorial Theory, Series A | 2006 | 5 Pages |
Abstract
Answering a question of Körner and Simonyi, this paper gives a strongly consecutive repeat-free code of maximal size in [b]n.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
