Displaying similar documents to “On the size of transducers for bidirectional decoding of prefix codes”

On the size of transducers for bidirectional decoding of prefix codes

Laura Giambruno, Sabrina Mantaci (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

In a previous paper [L. Giambruno and S. Mantaci, (2010) 1785–1792] a bideterministic transducer is defined for the bidirectional deciphering of words by the method introduced by Girod [ (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....

On the size of transducers for bidirectional decoding of prefix codes

Laura Giambruno, Sabrina Mantaci (2012)

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

Similarity:

In a previous paper [L. Giambruno and S. Mantaci, 411 (2010) 1785–1792] a bideterministic transducer is defined for the bidirectional deciphering of words by the method introduced by Girod [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...

On a complete set of operations for factorizing codes

Clelia De Felice (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

It is known that the class of , , codes satisfying the formulated by Schützenberger, is closed under two operations: the classical of codes and of codes. A natural question which arises is whether a finite set of operations exists such that each factorizing code can be obtained by using the operations in and starting with prefix or suffix codes. is named here a of operations (for factorizing codes). We show that composition and substitution are not enough in order to obtain a...

Parity codes

Paulo E. D. Pinto, Fábio Protti, Jayme L. Szwarcfiter (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Motivated by a problem posed by Hamming in 1980, we define even codes. They are Huffman type prefix codes with the additional property of being able to detect the occurrence of an odd number of 1-bit errors in the message. We characterize optimal even codes and describe a simple method for constructing the optimal codes. Further, we compare optimal even codes with Huffman codes for equal frequencies. We show that the maximum encoding in an optimal even code is at most two bits larger...

On the structure of linear recurrent error-control codes

Michel Fliess (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We are extending to linear recurrent codes, , to time-varying convolutional codes, most of the classic structural properties of fixed convolutional codes. We are also proposing a new connection between fixed convolutional codes and linear block codes. These results are obtained thanks to a module-theoretic framework which has been previously developed for linear control.