Open Access
Notes on Finite Maximal Infix Codes
Reads0
Chats0
TLDR
This paper constructs two kinds of maximal infix codes from a finite maximalinfix code, and shows that a finite infix code is a finite intersection of some finite maximal infIX codes.Abstract:
The fact that every finite infix code is contained in a finite maximal infix code was given in 1994 by Ito and Thierrin. In this paper, we construct two kinds of maximal infix codes from a finite maximal infix code. Then we show that a finite infix code is a finite intersection of some finite maximal infix codes.read more
References
More filters
Journal ArticleDOI
A quadratic upper bound on the size of a synchronizing word in one-cluster automata
TL;DR: It is shown that for any finite synchronized prefix code with an n-state decoder, there is a synchronizing word of length O(n2), which applies in particular to Huffman codes.
Journal ArticleDOI
Outfix and infix codes and related classes of languages
TL;DR: In this article, the authors derive properties of infix and outfix codes which describe their relation to other classes of codes and determine their combinatorial structures, including maximal codes, maximal codes within these classes, the syntactic monoids of such codes, and the connection of these codes with binary relations on the free monoid.
Journal ArticleDOI
Pattern matching in Huffman encoded texts
Shmuel T. Klein,Dana Shapira +1 more
TL;DR: For a given text which has been encoded by a static Huffman code, the possibility of locating a given pattern directly in the compressed text is investigated and an algorithm is suggested which reduces the number of erroneously declared matches.