Combinatorial problems motivated by comma‐free codes
V.I. Levenshtein · Journal of Combinatorial Designs · 2004
Abstract 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. © 2004 Wiley Periodicals, Inc.