Maximal Solid Codes
Year: 2001
Type: book
Abstract: In the hierarchy of classes of codes, the solid codes lie below the class of comma-free codes. They have a remarkable resistance to noise in information transmission: Every correctly transmitted code word can also be decoded correctly and without delay. The results of this paper concern maximal solid codes of variable length. First, it is shown that almost every finite non-maximal solid code can be embedded in an infinite maximal one. Second, all the maximal solid codes of a certain type are characterized. Finally, the relation of the maximal solid codes of that type to the Chomsky hierarchy is discussed.
Authors: Jürgensen, Helmut, Katsura, Masashi, Konstantinidis, Stavros
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W52418698
