Abstract
In the framework of two Schützenberger's conjectures on codes, we characterize the degree of finite maximal codes over the alphabet {a,b} with at most 3 occurrences of the letter b by word; it is strongly related to the number of factorizations of the code. We also describe all the indecomposable codes inside this family.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bentley J.L., Brown D.J., A general class of resource tradeoffs, J. Comput. System Sci 25 (1982), 214–238 and Proc. 21 th Symp. on Foundations of Computer Science (1980) 217–228
Berstel J., Perrin D., Theory of codes (Academic Press, New York, 1985).
Bertel J., Reutenauer C., Rational series and their languages, (EATCS Monographs 12, Springer-Verlag, 1988).
Boë J.M., Une famille remarquable de codes indécomposables, Lecture Notes in Comput. Sci. 62 (1978) 105–112.
Bruyère V., De Felice C., Degree and decomposability of variable-length codes, in preparation.
Césari Y., Sur l'application du théorème de Suschkevitch à l'étude des codes rationnels complets, Lecture Notes in Comput. Sci. (1974) 342–350.
Cohn P.M., On a generalization of the Euclidean algorithm, Proc. Cambridge Philos. Soc. 57 (1961) 18–30.
De Felice C., Construction of a family of finite maximal codes, Theoret. Comput. Sci. 63 (1989) 157–184.
De Felice C., A partial result about factorization conjecture (1990) submitted.
De Felice C., Reutenauer C., Solution partielle de la conjecture de factorisation des codes, C.R. Acad. Sci. Paris 302 (1986) 169–170.
Fuchs L., Abelian groups (Pergamon Press, Oxford, 1960).
Hajos G., Sur le problème de factorisation des groupes cycliques, Acta Math. Acad. Sc. Hungaricae 1 (1950) 189–195.
Krasner M., Ranulac B., Sur une propriété des polynômes de la division du cercle, C.R. Acad. Sci. Paris 240 (1937) 397–399.
Nivat M., Eléments de la théorie des codes, in “Automata Theory” (E. Caianiello Ed.), Academic Press (1966) 278–294.
Perrin D., Codes asynchrones, Bull. Soc. Math. France 105 (1977) 385–404.
Perrin D., Schützenberger M.P., Un problème élémentaire de la théorie de l'information, Théorie de l'Information, Colloques Internat. CNRS 276, Cachan (1977) 249–260.
Restivo A., On codes having no finite completions, Discrete Math. 17 (1977) 309–316.
Reutenauer C., Noncommutative factorization of variable-length codes, J. Pure and Applied Algebra 36 (1985) 167–186.
Schützenberger M.P., Une theorie algébrique du codage, Séminaire Dubreil-Pisot 1955–56, exposé no15.
Schützenberger M.P., Codes à longueur variable, in “Théorie des codes” (D. Perrin Ed.) LITP (1979) 247–271.
Vincent M., Construction de codes indécomposables, RAIRO Informat. Théor. 19 (1985) 165–178.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruyere, V., De Felice, C. (1991). Degree and decomposability of variable-length codes. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_165
Download citation
DOI: https://doi.org/10.1007/3-540-54233-7_165
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54233-9
Online ISBN: 978-3-540-47516-3
eBook Packages: Springer Book Archive