Autori: F.L. Tiplea, E. Mäkinen, D. Trinca, C. Enea

Editorial: IOS Press, Fundamenta Informaticae, 52, p.1-13, 2002.

Rezumat:

Time-varying codes associate variable
length code words to letters being encoded depending on their positions in the input string. These codes have been introduced in cite{TiME2002} as a proper extension of L-codes.

This paper is devoted to a further study
of time-varying codes. First, we show that adaptive Huffman encodings are special cases of encodings by time-varying codes. Then, we focus on three kinds of characterization results: characterization results based on decompositions over families of sets of words, a Schutzenberger like criterion,
and a Sardinas-Patterson like
characterization theorem. All of them extend the corresponding characterization results known for
classical variable length codes.

Cuvinte cheie: variable-length codes

URL: http://fi.mimuw.edu.pl/