Abstract
We consider the problem of timed channel coding: given two timed languages, can we transmit the information produced by the first, used as information source, as words of the second, used as communication channel? More precisely, we look at coding with bounded delay: having a uniform bound between the timed length of any word from the source and its encoding on the channel. Moreover, we consider approximated coding satisfying the following property: whenever the channel word is observed with precision \(\varepsilon '\), then the original word can be recovered with precision \(\varepsilon \).
Our solution is based on the new notion of \(\varepsilon \)-bandwidth of a timed language, which characterises the quantity of information in its words, in bits per time unit, when these words are observed with precision \(\varepsilon \). We present basic properties of \(\varepsilon \)-bandwidth of timed regular languages, and establish a necessary, and a sufficient simple condition for existence of bounded delay coding in terms of bandwidths of the source and the channel.
This work was funded by ANR project MAVeriQ ANR-CE25-0012.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994). https://doi.org/10.1016/0304-3975(94)90010-8
Asarin, E., Basset, N., Béal, M.-P., Degorre, A., Perrin, D.: Toward a timed theory of channel coding. In: Jurdziński, M., Ničković, D. (eds.) FORMATS 2012. LNCS, vol. 7595, pp. 27–42. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33365-1_4
Asarin, E., Basset, N., Degorre, A.: Distance on timed words and applications. In: Jansen, D.N., Prabhakar, P. (eds.) FORMATS 2018. LNCS, vol. 11022, pp. 199–214. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00151-3_12
Blahut, R.E.: Digital Transmission of Information. Addison Wesley, Boston (1990)
Fekete, M.: Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten. Math. Z. 17, 228–249 (1923). https://doi.org/10.1007/BF01504345
Immink, K.: EFMPlus: the coding format of the multimedia compact disc. IEEE Trans. Consum. Electron. 41(3), 491–497 (1995). https://doi.org/10.1109/30.468040
Kocher, P., et al.: Spectre attacks: exploiting speculative execution. In: IEEE Symposium on Security and Privacy (S &P 2019) (2019). https://doi.org/10.1109/SP.2019.00002
Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104–113. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-68697-5_9
Kolmogorov, A.N., Tikhomirov, V.M.: \(\varepsilon \)-entropy and \(\varepsilon \)-capacity of sets in function spaces. Uspekhi Matematicheskikh Nauk 14(2), 3–86 (1959). https://doi.org/10.1007/978-94-017-2973-4_7. http://mi.mathnet.ru/eng/umn7289
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Lipp, M., et al.: Meltdown: reading kernel memory from user space. Commun. ACM 63(6), 46–56 (2020). https://doi.org/10.1145/3357033
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Jacobo Inclán, B., Degorre, A., Asarin, E. (2022). Bounded Delay Timed Channel Coding. In: Bogomolov, S., Parker, D. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2022. Lecture Notes in Computer Science, vol 13465. Springer, Cham. https://doi.org/10.1007/978-3-031-15839-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-15839-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-15838-4
Online ISBN: 978-3-031-15839-1
eBook Packages: Computer ScienceComputer Science (R0)