Generating Functions of Circular Codes

Arquès, 1995, A possible code in the genetic code, 900

F. Bassino, Séries rationnelles et distributions de longueurs, Université de Marne-La-Vallée, 1996

Bruyère, 1996, Variable-length maximal codes, 1099

Berstel, 1985

Csiszar, 1969, Simple proofs of some theorems on noiseless channels, Inform. and Control, 14, 185, 10.1016/S0019-9958(69)90084-9

Ehrenfeucht, 1985, Each regular code is included in a regular maximal code, RAIRO Inform. Théor. Appl., 20, 89, 10.1051/ita/1986200100891

H. Gaudier, Le lemme des signes, 1996

Golomb, 1965, Codes with bounded synchronisation delay, Inform. and Control, 8, 355, 10.1016/S0019-9958(65)90300-1

Golomb, 1958, Comma-free codes, Canadian J. Math., 10, 202, 10.4153/CJM-1958-023-9

Krause, 1962, Channel which transmit letters of unequal duration, Inform. and Control, 5, 13, 10.1016/S0019-9958(62)90183-3

Krob, 1987, Codes limités et factorisations finies due monoı̈de libre, RAIRO Inform. Théor. Appl., 21, 437, 10.1051/ita/1987210404371

Metropolis, 1983, Witt vectors and the algebra of necklaces, Adv. Math., 50, 95, 10.1016/0001-8708(83)90035-X

Reutenauer, 1988, Mots circulaires et polynômes irréductibles, Ann. Sci. Math. Québec, 12, 275

Schützenberger, 1965, On a factorization of free monoids, Proc. Amer. Math. Soc., 16, 21, 10.2307/2033993

Schützenberger, 1965, Sur une question concernant certains sous-monoı̈des libres, C. R. Acad. Sci. Paris Groupe 1, 261, 2419

Shannon, 1948, A mathematical theory of communication, Bell Sys. Tech. J., 27, 379, 10.1002/j.1538-7305.1948.tb01338.x

Stanely, 1986, I

Viennot, 1978, Algèbres de Lie libres et Monoı̈des libres, Lecture Notes in Math, 691