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.
|Numero di pagine||17|
|Rivista||International Journal of Foundations of Computer Science|
|Stato di pubblicazione||Published - 2015|
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)