On the size of transducers for bidirectional decoding of prefix codes
Giambruno, Laura ; Mantaci, Sabrina
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 46 (2012), p. 315-328 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)

In a previous paper [L. Giambruno and S. Mantaci, Theoret. Comput. Sci. 411 (2010) 1785-1792] a bideterministic transducer is defined for the bidirectional deciphering of words by the method introduced by Girod [IEEE Commun. Lett. 3 (1999) 245-247]. Such a method is defined using prefix codes. Moreover a coding method, inspired by the Girod's one, is introduced, and a transducer that allows both right-to-left and left-to-right decoding by this method is defined. It is proved also that this transducer is minimal. Here we consider the number of states of such a transducer, related to some features of the considered prefix code X. We find some bounds of such a number of states in relation with different notions of “size” of X. In particular, we give an exact formula for the number of states of transducers associated to maximal prefix codes. We moreover consider two special cases of codes: maximal uniform codes and a class of codes, that we name string-codes. We show that they represent, for maximal codes, the extreme cases with regard to the number of states in terms of different sizes. Moreover we prove that prefix codes corresponding to isomorphic trees have transducers that are isomorphic as unlabeled graphs.

Publié le : 2012-01-01
DOI : https://doi.org/10.1051/ita/2012006
Classification:  94B35,  68P30,  94A45 
@article{ITA_2012__46_2_315_0,
     author = {Giambruno, Laura and Mantaci, Sabrina},
     title = {On the size of transducers for bidirectional decoding of prefix codes},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {46},
     year = {2012},
     pages = {315-328},
     doi = {10.1051/ita/2012006},
     mrnumber = {2931251},
     zbl = {1278.94038},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_2012__46_2_315_0}
}

Giambruno, Laura; Mantaci, Sabrina. On the size of transducers for bidirectional decoding of prefix codes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 46 (2012) pp. 315-328. doi : 10.1051/ita/2012006. http://gdmltest.u-ga.fr/item/ITA_2012__46_2_315_0/

[1] M.-P. Béal, J. Berstel, B.H. Marcus, D. Perrin, C. Reutenauer and P.H. Siegel, Variable-length codes and finite automata, in Selected Topics in Information and Coding Theory, edited by I. Woungang. World Scientific. To appear. | Zbl 1206.94105

[2] J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985). | MR 797069 | Zbl 0587.68066

[3] J. Berstel, D. Perrin and C. Reutenauer, Codes and Automata. Cambridge University Press (2010). | MR 2567477 | Zbl 1187.94001

[4] A.S. Fraenkel and S.T. Klein, Bidirectional Huffman coding.Comput. J. 33 (1990) 296-307. | MR 1075260

[5] L. Giambruno and S. Mantaci, Transducers for the bidirectional decoding of prefix codes, Theoret. Comput. Sci. 411 (2010) 1785-1792. | MR 2650341 | Zbl 1194.94177

[6] B. Girod, Bidirectionally decodable streams of prefix code words. IEEE Commun. Lett. 3 (1999) 245-247.

[7] M. Lothaire, Applied combinatorics on words, Encyclopedia of Mathematics and its Applications 104(2005). | MR 2165687 | Zbl 1133.68067

[8] D. Salomon, Variable-Length Codes for Data Compression. Springer-Verlag (2007). | MR 2374975 | Zbl 1194.94176