Finite maximal solid codes

Solid codes, a special class of bifix codes, were introduced recently in the connection with formal languages. However, they have a much earlier history and more important motivation in information transmission dating back to the 1960s. In this paper, they are studied as an independent subject in the theory of variable-length codes. It is shown that every finite solid code is contained in a finite maximal one; based on further analysis of the structure of finite maximal solid codes, an algorithm is proposed to construct all of them starting from the most simple and evident ones.

[1]  Stavros Konstantinidis,et al.  Maximal Solid Codes , 2001, J. Autom. Lang. Comb..

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

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

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

[5]  Huei-Jan Shyr,et al.  Solid codes and disjunctive domains , 1990 .

[6]  Helmut Jürgensen,et al.  Solid Codes , 1991, J. Inf. Process. Cybern..

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