Search

Girod's encoding method has been introduced in order to efficiently decode from both directions messages encoded by using finite prefix codes. In the present paper, we generalize this method to finite codes with a finite deciphering delay. In particular, we show that our decoding algorithm can be realized by a deterministic finite transducer. We also investigate some properties of the underlying unlabeled graph. [ABSTRACT FROM AUTHOR]

Abstract: We construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod (1999) in and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding. We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of Girod’s encoding method. We prove that it has the same properties as those of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal. [Copyright &y& Elsevier]