KIAM Main page Web Library  •  Publication Searh  Русский 

Article, 2003
Discrete Mathematics
Authors: Levenshtein V.I.
Combinatorial problems motivated by comma-free codes
In the paper some combinatorial problems motivated by comma-free codes are considered. We describe these problems, give the most significant known results and methods used, present some new results and formulate open problems.
comma-free codes, comma-free index, comma-free sequence, codes without overlaps, difference systems of sets, synchronization.
Publication language: english
Research direction:
Mathematical problems and theory of numerical methods
Source text: