### Abstract

Lingua originale | English |
---|---|

Titolo della pubblicazione ospite | Developments in Language Theory, Lecture Notes in Computer Science Volume 7410 |

Pagine | 471-476 |

Numero di pagine | 6 |

Stato di pubblicazione | Published - 2012 |

### Serie di pubblicazioni

Nome | LECTURE NOTES IN COMPUTER SCIENCE |
---|

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cita questo

*Developments in Language Theory, Lecture Notes in Computer Science Volume 7410*(pagg. 471-476). (LECTURE NOTES IN COMPUTER SCIENCE).

**A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay.** / Mantaci, Sabrina; Selmi, Carla; Giambruno, Laura; Néraud, Jean.

Risultato della ricerca: Chapter

*Developments in Language Theory, Lecture Notes in Computer Science Volume 7410.*LECTURE NOTES IN COMPUTER SCIENCE, pagg. 471-476.

}

TY - CHAP

T1 - A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay

AU - Mantaci, Sabrina

AU - Selmi, Carla

AU - Giambruno, Laura

AU - Néraud, Jean

PY - 2012

Y1 - 2012

N2 - In this paper we generalize an encoding method due to Girod (cf. [6]) using prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers associated to different keys have an isomorphic non trivial strongly connected component.

AB - In this paper we generalize an encoding method due to Girod (cf. [6]) using prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers associated to different keys have an isomorphic non trivial strongly connected component.

UR - http://hdl.handle.net/10447/103125

UR - http://link.springer.com/chapter/10.1007%2F978-3-642-31653-1_43

M3 - Chapter

SN - 978-3-642-31652-4

T3 - LECTURE NOTES IN COMPUTER SCIENCE

SP - 471

EP - 476

BT - Developments in Language Theory, Lecture Notes in Computer Science Volume 7410

ER -