Abstract
Using the definition of gsm and finite translators, a new class of coders is proposed. In the first part it is shown that ifM is a weakly-deterministic coder, thenM −1 is also a coder. In the second part, this class of coders is used for solving a problem of secrets transmission.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A., Ullman, J.D.: The theory of parsing, translation and compiling, vol 1. Englewood Cliffs, NJ: Prentice Hall 1972
Paun, Gh., Salomaa, A.: Semi-commutativity sets — a cryptographically grounded topic. Bull. Math. Soc. Sci. Math. Roumanie35, 3–4 (1991)
Rayward-Smith, V.J.: Mealy machines as coding devices. In: Beker, H.J., Poper, F.C. (eds.) Cryptography and codings. Oxford: Clarendon Press 1989
Salomaa, A.: Public-key cryptography. Berlin Heidelberg New York: Springer 1990
Salomaa, A., Sàntean Lila: Secret selling of secrets with several buyers. Bull EATCS42, 178–186 (1990)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Atanasiu, A. A class of coders based on GSM. Acta Informatica 29, 779–791 (1992). https://doi.org/10.1007/BF01191896
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01191896