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

Laura Giambruno (1) , Sabrina Mantaci (2) , Jean Néraud (3) , Carla Selmi (3)

1 Equipe AMACC - Laboratoire GREYC - UMR6072
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
3 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes

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

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]; Théorie et langage formel [cs.FL]

Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi. A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay. Developments in Language Theory 2012, Aug 2012, Tapei, Taiwan. pp.471-476, ⟨10.1007/978-3-642-31653-1⟩. ⟨hal-00913504⟩