Premium
Combinatorial problems motivated by comma‐free codes
Author(s) -
Levenshtein Vladimir I.
Publication year - 2004
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.10071
Subject(s) - mathematics , combinatorics , combinatorial optimization , combinatorial algorithms , discrete mathematics , algorithm
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.