Abstract
In the Information Embedding Problem one is given a piece of data which can be altered only conditionally, for example only at certain places. One is then asked to embed an arbitrary message into the data by only applying admissible changes to the data. These changes lead to a distortion which is to be kept low. In this short note, we introduce an “asymmetric” version of information embedding in which the file is regarded as a string over a finite alphabet, and admissible changes on the alphabet elements are modeled by a directed graph. We introduce embedding techniques based on list-decoding algorithms for algebraic–geometric codes, and analyze their performance.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Garcia, A., Stichtenoth, H.: A tower of Artin–Schreier extensions of function fields attaining the Drinfeld-Vladut bound. Invent. Math. 121, 211–222 (1995)
Guruswami, V., Sudan, M.: Improved decoding of Reed–Solomon and algebraic–geometric codes. IEEE Trans. Inform. Theor 45, 1757–1767 (1999)
Kötter, R., Vardy, A.: Algebraic soft decision decoding of Reed–Solomon codes. IEEE Trans. Inform. Theor. 49, 2809–2825 (2003)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
Tsfasman, M., Vladut, S., Zink, T.: Modular curves, Shimura curves, and Goppa codes better than the Varshamov–Gilbert bound. Math. Nachrichten 109, 21–28 (1982)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Shokrollahi, A. Asymmetric information embedding. AAECC 19, 229–239 (2008). https://doi.org/10.1007/s00200-008-0075-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-008-0075-z