A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay

International audienceGirod"s encoding method has been introduced in order to efficiently decode from both directions messages encoded by using prefix codes. In the present paper, we generalize this method to 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 corresponding unlabeled graph

A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay

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