Previous Page 2

Displaying 21 – 23 of 23

Showing per page

On the size of transducers for bidirectional decoding of prefix codes

Laura Giambruno, Sabrina Mantaci (2012)

RAIRO - Theoretical Informatics and Applications

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...

Polypodic codes

Symeon Bozapalidis, Olympia Louscou-Bozapalidou (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.

Polypodic codes

Symeon Bozapalidis, Olympia Louscou–Bozapalidou (2010)

RAIRO - Theoretical Informatics and Applications

Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.

Currently displaying 21 – 23 of 23

Previous Page 2