Variable-Length Maximal Codes

In this survey, we present some of the main open problems in the theory of variable-length codes, together with the major advancements recently realized to solve them.

[1]  Yves Césari.  Sur l'application du theoreme de Suschkewitsch a l'etude des codes rationnets complets , 1974 .

[2]  Janusz A. Brzozowski,et al.  OPEN PROBLEMS ABOUT REGULAR LANGUAGES , 1980 .

[3]  Andrzej Ehrenfeucht,et al.  Each Regular Code Is Included in A Maximal Regular Code , 1986, RAIRO Theor. Informatics Appl..

[4]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[5]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[6]  Antonio Restivo,et al.  Some Results On Finite Maximal Codes , 1985, RAIRO Theor. Informatics Appl..

[7]  de Ng Dick Bruijn.  On the Factorization of Finite Abelian Groups , 1953 .

[8]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[9]  Robert J. McEliece,et al.  The Theory of Information and Coding , 1979 .

[10]  Christophe Reutenauer,et al.  Solution partielle de la conjecture de factorisation des codes , 1986 .

[11]  Véronique Bruyère,et al.  On Completion of Codes with Finite Deciphering Delay , 1990, Eur. J. Comb..

[12]  Nguyen Huong Lam,et al.  On Codes Having no Finite Completion , 1994, RAIRO Theor. Informatics Appl..

[13]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

[14]  Liang Zhang,et al.  Completion of Recognizable Bifix Codes , 1995, Theor. Comput. Sci..

[15]  H. Shyr.  Free monoids and languages , 1979 .

[16]  Christophe Reutenauer,et al.  Noncommutative factorization of variable-length codes , 1985 .

[17]  J. Berstel,et al.  Theory of codes , 1985 .

[18]  Al. A. Markov.  Example of an independent system of words which cannot be included in a finite complete system , 1967 .

[19]  Brian H. Marcus,et al.  Surjective Extensions of Sliding-Block Codes , 1993, SIAM J. Discret. Math..

[20]  Antonio Restivo,et al.  On codes having no finite completions , 1977, Discret. Math..

[21]  Rosa Montalbano.  Local Automata and Completion , 1993, STACS.

[22]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[23]  A. D. Sands.  On a conjecture of G. Hajós , 1974, Glasgow Mathematical Journal.

[24]  Véronique Bruyère,et al.  Automata and Codes with Bounded Deciphering Delay , 1992, LATIN.

[25]  Denis Derencourt.  A Three-Word Code Which is Not Prefix-Suffix Composed , 1996, Theor. Comput. Sci..

[26]  Dominique Perrin.  Completing Biprefix Codes , 1984, Theor. Comput. Sci..

[27]  Arturo Carpi,et al.  On Synchronizing Unambiguous Automata , 1988, Theor. Comput. Sci..

[28]  Jean-Marie Boë.  Une Famille Remarquable de Codes Indecomposables , 1978, ICALP.

[29]  Clelia de Felice,et al.  A partial result about the factorization conjecture for finite variable-length codes , 1993, Discret. Math..

[30]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[31]  Nicolette De Bruijn,et al.  On the factorization of cyclic groups , 1953 .

[32]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[33]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[34]  M. P. Schützenberger.  On a question concerning certain free submonoids , 1966 .

[35]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[36]  Peter W. Shor,et al.  A Counterexample to the Triangle Conjecture , 1985, J. Comb. Theory, Ser. A.

[37]  M. Schützenberger,et al.  Sur certains sous-monoïdes libres , 1965 .

[38]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.