Abstract
We begin with
I. The identifiable parent property and some first results about it If \({\mathcal C}\) is a q–ary code of length n and a n and b n are two codewords, then c n is called a descendant of a n and b n if c t ∈{a t , b t } for t=1,...,n. We are interested in codes \({\mathcal C}\) with the property that, given any descendant c n, one can always identify at least one of the ‘parent’ codewords in \({\mathcal C}\). We study bounds on F(n,q), the maximal cardinality of a code \({\mathcal C}\) with this property, which we call the identifiable parent property. Such codes play a role in schemes that protect against piracy of software.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahlswede, R.: Multi–way communication channels. In: Proceedings of 2nd International Symposium on Information Theory, Thakadsor, Armenian SSR, Akademiai Kiado, Budapest, September 1971, pp. 23–52 (1973)
Ahlswede, R.: The capacity region of a channel with two senders and two receivers. Ann. Probability 2(5), 805–814 (1974)
Ahlswede, R.: An elementary proof of the strong converse theorem for the multiple–access channel. J. Combinatorics, Information and System Sciences 7(3), 216–230 (1982)
Ahlswede, R., Cai, N.: Arbitrarily varying multiple–access channels, Part I. Ericson’s symmetrizability is adequate, Gubner’s conjecture is true. IEEE Trans. Inf. Theory 45(2), 742–749 (1999)
Ahlswede, R., Dueck, G.: Every bad code has a good subcode: a local converse to the coding theorem. Z. Wahrscheinlichkeitstheorie und verw. Geb. 34, 179–182 (1976)
Ahlswede, R., Gács, P., K”orner, J.: Bounds on conditional probabilities with applications in multiuser communication. Z. Wahrscheinlichkeitstheorie und verw. Geb. 34, 157–177 (1976)
Csiszár, I., K”orner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, London (1981)
Dueck, G.: The strong converse to the coding theorem for the multiple–access channel. J. Combinatorics, Information & System Science, 187–196 (1981)
Hollmann, H.D.L., van Lint, J.H., Linnartz, J.P., Tolhuizen, L.M.G.M.: On codes with the identifiable parent property. J. Combin. Theory Ser. A 82(2), 121–133 (1998)
K”orner, J., Marton, K.: Images of a set via two channels and their role in multi–user comunication. IEEE Transactions on Information Theory 23, 751–761 (1977)
Viemeister, J.: Die Theorie Selektierender Versuche und Multiple–Access–Kan”ale, Diplomarbeit, Universit”at Bielefeld (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Cai, N. (2006). Codes with the Identifiable Parent Property and the Multiple-Access Channel. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_12
Download citation
DOI: https://doi.org/10.1007/11889342_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)