Restrictions and generalizations on comma-free codes
The electronic journal of combinatorics, Tome 16 (2009) no. 1
A significant sector of coding theory is that of comma-free coding; that is, codes which can be received without the need of a letter used for word separation. The major difficulty is in finding bounds on the maximum number of comma-free words which can inhabit a dictionary. We introduce a new class called a self-reflective comma-free dictionary and prove a series of bounds on the size of such a dictionary based upon word length and alphabet size. We also introduce other new classes such as self-swappable comma-free codes and comma-free codes in q dimensions and prove preliminary bounds for these classes. Finally, we discuss the implications and applications of combining these original concepts, including their implications for the NP-complete Post Correspondence Problem.
@article{10_37236_114,
author = {Alexander L. Churchill},
title = {Restrictions and generalizations on comma-free codes},
journal = {The electronic journal of combinatorics},
year = {2009},
volume = {16},
number = {1},
doi = {10.37236/114},
zbl = {1160.94017},
url = {http://geodesic.mathdoc.fr/articles/10.37236/114/}
}
Alexander L. Churchill. Restrictions and generalizations on comma-free codes. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/114
Cité par Sources :