Combinatorial problems motivated by comma‐free codes

200462 citationsJournal Articlebronze Open Access

Authors

V.I. Levenshtein · Keldysh Institute of Applied Mathematics

Abstract

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.

Topics & Keywords

Coding theory and cryptography graph theory and CDMA systems Algorithms and Data Compression

Publication Details

Published in: Journal of Combinatorial Designs

Volume 12, Issue 3, pp. 184-196

DOI: 10.1002/jcd.10071

Field-Weighted Citation Impact: 4.23

Command Palette

Combinatorial problems motivated by comma‐free codes

Authors

Abstract

Topics & Keywords

Publication Details