Combinatorial problems motivated by comma‐free codes

DOI10.1002/jcd.10071zbMath1059.94011MaRDI QIDQ4736762

Vladimir I. Levenshtein

Publication date: 6 August 2004

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.10071

zbMATH Keywords

synchronization; difference systems of sets; comma-free codes; codes without overlaps; comma-free index; comma-free sequence; decoding automaton

Mathematics Subject Classification ID

68Q45: Formal languages and automata

05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)

94A45: Prefix, length-variable, comma-free codes

Related Items

Partitioned difference families and almost difference sets, Optimal difference systems of sets and difference sets, Constructions of external difference families and disjoint difference families, Hyperplane partitions and difference systems of sets, Binary templates for comma-free DNA codes, Difference systems of sets and cyclotomy, Constructions of partitioned difference families, Optimal and perfect difference systems of sets, Perfect difference systems of sets and Jacobi sums, An algorithm for optimal difference systems of sets, Optimal and perfect difference systems of sets from \(q\)-ary sequences with difference-balanced property

Cites Work

• Unnamed Item
• Unnamed Item
• Comma-Free Codes
• A New Result on Comma-Free Codes of Even Word-Length
• Regent Results in Comma-Free Codes