Some results on finite maximal codes
RAIRO. Inform. théor., 19 4 (1985) 383-403
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Embedding a θ-invariant code into a complete one
Jean Néraud and Carla SelmiTheoretical Computer Science 806 28 (2020)
https://doi.org/10.1016/j.tcs.2018.08.022
On a complete set of operations for factorizing codes
Clelia De FeliceRAIRO - Theoretical Informatics and Applications 40 (1) 29 (2006)
https://doi.org/10.1051/ita:2005040
Locally complete sets and finite decomposable codes
Jean Néraud and Carla SelmiTheoretical Computer Science 273 (1-2) 185 (2002)
https://doi.org/10.1016/S0304-3975(00)00440-0
ON A PROPERTY OF THE FACTORIZING CODES
CLELIA DE FELICEInternational Journal of Algebra and Computation 09 (03n04) 325 (1999)
https://doi.org/10.1142/S0218196799000217
Hajós factorizations and completion of codes
Nguyen Huong LamTheoretical Computer Science 182 (1-2) 245 (1997)
https://doi.org/10.1016/S0304-3975(97)00032-7
Handbook of Formal Languages
Helmut Jürgensen and Stavros KonstantinidisHandbook of Formal Languages 511 (1997)
https://doi.org/10.1007/978-3-642-59136-5_8
On codes having no finite completion
Nguyen Huong LamRAIRO - Theoretical Informatics and Applications 30 (6) 483 (1996)
https://doi.org/10.1051/ita/1996300604831
An application of Hajós factorizations to variable-length codes
Clelia De FeliceTheoretical Computer Science 164 (1-2) 223 (1996)
https://doi.org/10.1016/0304-3975(95)00223-5
Automata, Languages and Programming
Véronique Bruyère and Michel LatteuxLecture Notes in Computer Science, Automata, Languages and Programming 1099 24 (1996)
https://doi.org/10.1007/3-540-61440-0_115
On codes having no finite completion
Nguyen Huong LamRAIRO - Theoretical Informatics and Applications 29 (2) 145 (1995)
https://doi.org/10.1051/ita/1995290201451
A note on codes having no finite completions
Nguyen Huong LamInformation Processing Letters 55 (4) 185 (1995)
https://doi.org/10.1016/0020-0190(95)00102-I
STACS 94
Nguyen Huong LamLecture Notes in Computer Science, STACS 94 775 691 (1994)
https://doi.org/10.1007/3-540-57785-8_182
Fundamentals of Computation Theory
H. Jürgensen and S. KonstantinidisLecture Notes in Computer Science, Fundamentals of Computation Theory 710 50 (1993)
https://doi.org/10.1007/3-540-57163-9_4
Languages whose n-element subsets are codes
M. Ito, H. Jürgensen, H.J. Shyr and G. ThierrinTheoretical Computer Science 96 (2) 325 (1992)
https://doi.org/10.1016/0304-3975(92)90341-C
Construction of a family of finite maximal codes
Clelia De FeliceTheoretical Computer Science 63 (2) 157 (1989)
https://doi.org/10.1016/0304-3975(89)90076-5
Completing codes
A. Restivo, S. Salemi and T. SportelliRAIRO - Theoretical Informatics and Applications 23 (2) 135 (1989)
https://doi.org/10.1051/ita/1989230201351
STACS 88
Clelia De FeliceLecture Notes in Computer Science, STACS 88 294 159 (1988)
https://doi.org/10.1007/BFb0035842
Pure and Applied Mathematics
Pure and Applied Mathematics 117 424 (1985)https://doi.org/10.1016/S0079-8169(08)61773-0