Codes with the identifiable parent property and the multiple-access channel

Authors:
R. Ahlswede;N. Cai
Affiliations:
Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany;Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany
Venue:
General Theory of Information Transfer and Combinatorics
Year:
2006

Citing 3
Cited 4

On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true

IEEE Transactions on Information Theory

Bounds and capacity results for the cognitive Z-interference channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
The secrecy capacity of the semi-deterministic broadcast channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Capacity regions and bounds for a class of Z-interference channels

IEEE Transactions on Information Theory
Bibliography of publications by Rudolf Ahlswede

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	0.06

Visualization

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 an and bn are two codewords, then cn is called a descendant of an and bn if ct ∈{at , bt} for t=1,...,n. We are interested in codes ${\mathcal C}$ with the property that, given any descendant cn, 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.