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.

Giambruno, L., & Mantaci, S. (2012). On the size of transducers for bidirectional decoding of prefix codes. RAIRO. INFORMATIQUE THEORIQUE ET APPLICATIONS, 46, 315-328 [10.1051/ita/2012006].

On the size of transducers for bidirectional decoding of prefix codes

GIAMBRUNO, Laura;MANTACI, Sabrina
2012

Abstract

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.
Settore INF/01 - Informatica
http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=8553465
Giambruno, L., & Mantaci, S. (2012). On the size of transducers for bidirectional decoding of prefix codes. RAIRO. INFORMATIQUE THEORIQUE ET APPLICATIONS, 46, 315-328 [10.1051/ita/2012006].
File in questo prodotto:
File Dimensione Formato  
ita110046.pdf

Solo gestori archvio

Dimensione 202.77 kB
Formato Adobe PDF
202.77 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/10447/75585
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 2
social impact