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:

Some results on finite maximal codes

Clelia De Felice, Antonio Restivo

RAIRO. Inform. théor., 19 4 (1985) 383-403

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1985190403831

This article has been cited by the following article(s):

ON A PROPERTY OF THE FACTORIZING CODES

CLELIA DE FELICE
International Journal of Algebra and Computation 09 (03n04) 325 (1999)
DOI: 10.1142/S0218196799000217
See this article

Hajós factorizations and completion of codes

Nguyen Huong Lam
Theoretical Computer Science 182 (1-2) 245 (1997)
DOI: 10.1016/S0304-3975(97)00032-7
See this article

Construction of a family of finite maximal codes

Clelia De Felice
Theoretical Computer Science 63 (2) 157 (1989)
DOI: 10.1016/0304-3975(89)90076-5
See this article

Locally complete sets and finite decomposable codes

Jean Néraud and Carla Selmi
Theoretical Computer Science 273 (1-2) 185 (2002)
DOI: 10.1016/S0304-3975(00)00440-0
See this article

An application of Hajós factorizations to variable-length codes

Clelia De Felice
Theoretical Computer Science 164 (1-2) 223 (1996)
DOI: 10.1016/0304-3975(95)00223-5
See this article

A note on codes having no finite completions

Nguyen Huong Lam
Information Processing Letters 55 (4) 185 (1995)
DOI: 10.1016/0020-0190(95)00102-I
See this article

Languages whose n-element subsets are codes

M. Ito, H. Jürgensen, H.J. Shyr and G. Thierrin
Theoretical Computer Science 96 (2) 325 (1992)
DOI: 10.1016/0304-3975(92)90341-C
See this article

On codes having no finite completion

Nguyen Huong Lam
RAIRO - Theoretical Informatics and Applications 29 (2) 145 (1995)
DOI: 10.1051/ita/1995290201451
See this article

117 424 (1985)
DOI: 10.1016/S0079-8169(08)61773-0
See this article

Clelia De Felice
294 159 (1988)
DOI: 10.1007/BFb0035842
See this article

Helmut Jürgensen and Stavros Konstantinidis
511 (1997)
DOI: 10.1007/978-3-642-59136-5_8
See this article

Nguyen Huong Lam
775 691 (1994)
DOI: 10.1007/3-540-57785-8_182
See this article

H. Jürgensen and S. Konstantinidis
710 50 (1993)
DOI: 10.1007/3-540-57163-9_4
See this article

Embedding a θ-invariant code into a complete one

Jean Néraud and Carla Selmi
Theoretical Computer Science 806 28 (2020)
DOI: 10.1016/j.tcs.2018.08.022
See this article

Véronique Bruyère and Michel Latteux
1099 24 (1996)
DOI: 10.1007/3-540-61440-0_115
See this article

Completing codes

A. Restivo, S. Salemi and T. Sportelli
RAIRO - Theoretical Informatics and Applications 23 (2) 135 (1989)
DOI: 10.1051/ita/1989230201351
See this article

On a complete set of operations for factorizing codes

Clelia De Felice
RAIRO - Theoretical Informatics and Applications 40 (1) 29 (2006)
DOI: 10.1051/ita:2005040
See this article

On codes having no finite completion

Nguyen Huong Lam
RAIRO - Theoretical Informatics and Applications 30 (6) 483 (1996)
DOI: 10.1051/ita/1996300604831
See this article