Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Béal, M.-P., Berstel, J., Marcus, B.H., Perrin, D., Reutenauer, C., Siegel, P.H.: Variable-length codes and finite automata. In: Woungang, I. (ed.) Selected Topics in Information and Coding Theory. World Scientific (to appear)
Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2010)
Fraenkel, A.S., Klein, S.T.: Bidirectional Huffman Coding. The Computer Journal 33, 296–307 (1990)
Giambruno, L., Mantaci, S.: Transducers for the bidirectional decoding of prefix codes. Theoretical Computer Science 411, 1785–1792 (2010)
Giambruno, L., Mantaci, S.: On the size of transducers for bidirectional decoding of prefix codes. Rairo-Theoretical Informatics and Applications (2012), doi:10.1051/ita/2012006
Girod, B.: Bidirectionally decodable streams of prefix code words. IEEE Communications Letters 3(8), 245–247 (1999)
Lothaire, M.: Applied combinatorics on words. Encyclopedia of mathematics and its applications, vol. 104. Cambridge University Press (2005)
Lind, D., Marcus, B.: An introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995)
Salomon, D.: Variable-Length Codes for Data Compression. Springer (2007)
Sakarovitch, J.: Éléments de théorie des automates. Vuibert Informatique (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giambruno, L., Mantaci, S., Néraud, J., Selmi, C. (2012). A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-31653-1_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31652-4
Online ISBN: 978-3-642-31653-1
eBook Packages: Computer ScienceComputer Science (R0)