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. (C) 2001 Elsevier Science B.V. All rights reserved.
finite maximal solid code solid code completion