6533b82efe1ef96bd1293c47
RESEARCH PRODUCT
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
Carla SelmiLaura GiambrunoSabrina MantaciJean Néraudsubject
Discrete mathematicsPrefix codeStrongly connected componentSettore INF/01 - InformaticaGeneralization020206 networking & telecommunications0102 computer and information sciences02 engineering and technology01 natural sciencesPrefix010201 computation theory & mathematicsEncoding (memory)0202 electrical engineering electronic engineering information engineeringCode (cryptography)AlphabetGirod's encoding codes finite deciphering delayDecoding methodsMathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2012-01-01 |