D. Arquès and C. J. Michel, A complementary circular code in the protein coding genes, Journal of Theoretical Biology, vol.182, pp.45-58, 1996.

D. Baji? and J. Stojanovi?, Distributed sequences and search process, IEEE International Conference on Communications, pp.514-518, 2004.

A. H. Ball and L. J. Cummings, Extremal digraphs and comma-free codes, Ars Combinatoria, vol.1, issue.1, pp.239-251, 1976.

, The comma-free codes with words of length two, Bull. Austral. Math. Soc, vol.14, issue.2, pp.249-258, 1976.

S. Bilotta, E. Grazzini, E. Pergola, and R. Pinzani, Avoiding cross-bifix-free binary words, Acta Inform, vol.50, issue.3, pp.157-173, 2013.

S. Bilotta, E. Pergola, and R. Pinzani, A new approach to cross-bifix-free sets, IEEE Trans. Inform. Theory, vol.58, issue.6, pp.4058-4063, 2012.

S. R. Blackburn, Non-overlapping codes, IEEE Transactions on Information Theory, vol.61, issue.9, pp.4890-4894, 2015.

D. A. Cartwright, M. A. Cueto, and E. A. Tobis, The maximum independent sets of de Bruijn graphs of diameter 3, Electron. J. Combin, vol.18, issue.1, p.18, 2011.

Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, Cross-bifix-free codes within a constant factor of optimality, IEEE Trans. Inform. Theory, vol.59, issue.7, p.3071351, 2013.

L. J. Cummings, Combinatorial mathematics, IV (Proc. Fourth Australian Conf., Univ. Adelaide, vol.560, pp.1-6, 1975.

F. H. Crick, J. S. Griffith, and L. E. Orgel, Codes without commas, Proceedings of the National Academy of Sciences of the United States of America, vol.43, issue.5, pp.416-421, 1957.

W. Eastman, On the construction of comma-free codes, IEEE Transactions on Information Theory, vol.11, issue.2, pp.263-267, 1965.

, COMMA-FREE CODES OVER FINITE ALPHABETS

E. Fimmel, C. J. Michel, F. Pirot, J. Sereni, and L. Strüngmann, Circular Mixed Codes, vol.317, p.108231, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02188407

E. Fimmel, C. J. Michel, and L. Strüngmann, n-nucleotide circular codes in graph theory, Philosophical Transactions of the Royal Society A, vol.374, issue.2063, 2016.

, Diletter circular codes over finite alphabets, Mathematical Biosciences, vol.294, pp.120-129, 2017.

, Strong Comma-Free Codes in Genetic Information, Bulletin of Mathematical Biology, vol.79, issue.8, pp.1796-1819, 2017.

E. Fimmel and L. Strüngmann, On the hierarchy of trinucleotide n-circular codes and their corresponding amino acids, Journal of Theoretical Biology, vol.364, pp.113-120, 2015.

, Maximal dinucleotide comma-free codes, Journal of Theoretical Biology, vol.389, pp.206-213, 2016.

, Mathematical Fundamentals for the noise immunity of the genetic code, BioSystems, vol.164, pp.186-198, 2018.

S. W. Golomb, B. Gordon, and L. R. Welch, Comma-free codes, Canadian Journal of Mathematics, vol.10, pp.202-209, 1958.

S. W. Golomb, L. R. Welch, and M. Delbrück, Construction and properties of comma-free codes, Kongelige Danske Videnskabernes Selskab, vol.23, pp.1-34

L. J. Guibas and A. M. Odlyzko, Maximal prefix-synchronized codes, SIAM J. Appl. Math, vol.35, issue.2, pp.401-418, 1978.

V. I. Leven?te?n, Decoding automata which are invariant with respect to the initial state, Problemy Kibernet. No, vol.12, pp.125-136, 1964.

V. N. Leven?te?n, The maximal number of words in codes without overlap, Problemy Pereda?i Informacii, vol.6, issue.4, pp.88-90, 1970.

V. I. Levenshtein, Combinatorial problems motivated by comma-free codes, J. Combin. Des, vol.12, issue.3, pp.184-196, 2004.

C. J. Michel, G. Pirillo, and M. A. Pirillo, Varieties of comma-free codes, Comput. Math. Appl, vol.55, issue.5, pp.989-996, 2008.

R. Scholtz, Maximal and variable word-length comma-free codes, IEEE Transactions on Information Theory, vol.15, issue.2, pp.300-306, 1969.

B. Tang, S. W. Golomb, and R. L. Graham, A new result on comma-free codes of even word-length, Canad. J. Math, vol.39, issue.3, pp.513-526, 1987.

P. Turán, Eine Extremalaufgabe aus der Graphentheorie, Mat. Fiz. Lapok, vol.48, pp.436-452, 1941.