Codes asynchrones
Perrin, Dominique
Bulletin de la Société Mathématique de France, Tome 105 (1977), p. 385-404 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{BSMF_1977__105__385_0,
     author = {Perrin, Dominique},
     title = {Codes asynchrones},
     journal = {Bulletin de la Soci\'et\'e Math\'ematique de France},
     volume = {105},
     year = {1977},
     pages = {385-404},
     doi = {10.24033/bsmf.1857},
     mrnumber = {57 \#11956},
     zbl = {0391.94017},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/BSMF_1977__105__385_0}
}

Perrin, Dominique. Codes asynchrones. Bulletin de la Société Mathématique de France, Tome 105 (1977) pp. 385-404. doi : 10.24033/bsmf.1857. http://gdmltest.u-ga.fr/item/BSMF_1977__105__385_0/

[1] Cesari (Y.). - Sur l'application du théorème de Suschkevitch à l'étude des codes rationnels complets, Automata, languages and programming. [1974, Saarbrücken]. Edited by J. Loeckx, p. 342-350. - Berlin, Springer-Verlag, 1974 (Lectures Notes in Computer Science, 14). | Zbl 0338.94004

[2] Cesari (Y.). - Sur un algorithme donnant les codes bipréfixes finis, Math. Syst. Theory, t. 6, 1972, p. 221-225. | MR 47 #8193 | Zbl 0241.94015

[3] Clifford (A. H.) and Preston (G. B.). - The algebraic theory of semigroups. Vol. 1. - Providence, American mathematical Society, 1961 (Mathematical Surveys, 7). | MR 24 #A2627 | Zbl 0111.03403

[4] Cohn (P. M.). - Free rings and their relations. - London, Academic Press, 1971 (London mathematical Society Monographs, 2). | MR 51 #8155 | Zbl 0232.16003

[5] Eilenberg (S.). - Automata, languages and machines. Vol. A. - New York, Academic Press, 1974 (Pure and applied Mathematics. Academic Press, 59-A). | MR 58 #26604a | Zbl 0317.94045

[6] Feller (W.). - An introduction to probability theory and its applications. Vol. 1, 2nd edition. - New York, J. Wiley and Sons, 1957 (Wiley Publications in Statistics). | Zbl 0077.12201

[7] Gilbert (E. N.) and Moore (E. F.). - Variable length binary encodings, Bell. Syst. Techn. J., t. 38, 1959, p. 933-967. | MR 21 #7129

[8] Golomb (S. W.) and Gordon (B.). - Codes with bounded synchronisation delay, Information and Control, t. 8, 1965, p. 355-372. | MR 31 #4648 | Zbl 0202.50404

[9] Nivat (M.). - Éléments de la théorie générale des codes, Automata theory, p. 278-294. - New York, Academic Press, 1966. | MR 39 #2513 | Zbl 0208.45101

[10] Perrin (D.). - La transitivité du groupe d'un code bipréfixe fini, Mathematische Z., t. 153, 1977, p. 283-287. | MR 56 #2641 | Zbl 0337.94005

[11] Perrot (J.-F.). - Groupes de permutations associés aux codes préfixes finis, Permutations. Actes du colloque sur les permutations [1972. Paris], p. 201-235. - Paris, Gauthier-Villars ; La Haye, Mouton, 1974. | Zbl 0294.94004

[12] Perrot (J.-F.). - Computer science and algebra : the theory of variable length codes, Theoretical Computer Science, p. 27-44. - Berlin, Springer-Verlag, 1976 (Lecture Notes in Computer Science, 48). | Zbl 0374.94009

[13] Sands (A. D.). - On the factorization of finite abelian groups, Acta Math. Acad. Sc. Hungaricae, t. 8, 1957, p. 65-86. | MR 19,529c | Zbl 0079.03303

[14] Sands (A. D.). - The factorisation of abelian groups, Quart. J. Math. Oxford Series 2, t. 10, 1959, p. 81-91. | MR 22 #65 | Zbl 0087.25604

[15] Schützenberger (M. P.). - Une théorie algébrique du codage, Séminaire Dubreil-Pisot : algèbre et théorie des nombres, 9e année, 1955-1956, n° 15, 24 p. | Numdam

[16] Schützenberger (M. P.). - On a special class of recurrent events, Annals of math. Stat., t. 32, 1961, p. 1201-1213. | MR 24 #A3718 | Zbl 0243.60049

[17] Schützenberger (M. P.). - Sur certains sous-monoïdes libres, Bull. Soc. math. France, t. 93, 1965, p. 209-223. | Numdam | MR 32 #7666 | Zbl 0149.02601

[18] Viennot (G.). - Algèbres de Lie libres et monoïdes libres, Thèse, Sc. math. Univ. Paris-VII, 1974.