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.

Giambruno, L., Mantaci, S., Néraud, J., Selmi, C. (2015). A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 26(6), 733-749 [10.1142/S0129054115500410].

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

MANTACI, Sabrina;
2015-01-01

Abstract

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.
2015
Giambruno, L., Mantaci, S., Néraud, J., Selmi, C. (2015). A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 26(6), 733-749 [10.1142/S0129054115500410].
File in questo prodotto:
File Dimensione Formato  
IJFCS15_2.pdf

accesso aperto

Descrizione: Articolo principale
Dimensione 250.05 kB
Formato Adobe PDF
250.05 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10447/202118
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact