Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Ahlswede, Rudolf
1978.
Elimination of correlation in random codes for arbitrarily varying channels.
Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete,
Vol. 44,
Issue. 2,
p.
159.
1981.
Information Theory.
p.
417.
Ahlswede, R.
and
Csiszar, I.
1981.
To get a bit of information may be as hard as to get full information.
IEEE Transactions on Information Theory,
Vol. 27,
Issue. 4,
p.
398.
Ahlswede, R.
and
Dueck, G.
1982.
Good codes can be produced by a few permutations.
IEEE Transactions on Information Theory,
Vol. 28,
Issue. 3,
p.
430.
Elias, P.
1988.
Zero error capacity under list decoding.
IEEE Transactions on Information Theory,
Vol. 34,
Issue. 5,
p.
1070.
Ahlswede, Rudolf
Ye, Jian-Ping
and
Zhang, Zhen
1990.
Creating order in sequence spaces with simple machines.
Information and Computation,
Vol. 89,
Issue. 1,
p.
47.
Elias, P.
1991.
Error-correcting codes for list decoding.
IEEE Transactions on Information Theory,
Vol. 37,
Issue. 1,
p.
5.
Ahlswede, R.
and
Csiszar, I.
1993.
Common randomness in information theory and cryptography. I. Secret sharing.
IEEE Transactions on Information Theory,
Vol. 39,
Issue. 4,
p.
1121.
Ahlswede, R.
Ning Cai
and
Zhen ZHang
1996.
Erasure, list, and detection zero-error capacities for low noise and a relation to identification.
IEEE Transactions on Information Theory,
Vol. 42,
Issue. 1,
p.
55.
Ahlswede, R.
Cai, N.
and
Zhang, Z.
1997.
On interactive communication.
IEEE Transactions on Information Theory,
Vol. 43,
Issue. 1,
p.
22.
Hughes, B.L.
1997.
The smallest list for the arbitrarily varying channel.
IEEE Transactions on Information Theory,
Vol. 43,
Issue. 3,
p.
803.
Lapidoth, A.
and
Narayan, P.
1998.
Reliable communication under channel uncertainty.
IEEE Transactions on Information Theory,
Vol. 44,
Issue. 6,
p.
2148.
Verdu, S.
1998.
Fifty years of Shannon theory.
IEEE Transactions on Information Theory,
Vol. 44,
Issue. 6,
p.
2057.
Ashikhmin, Alexei
Barg, Alexander
and
Litsyn, Simon
2000.
Numbers, Information and Complexity.
p.
239.
Ahlswede, R.
and
Ning Cai
2002.
Seminoisy deterministic multiple-access channels: coding theorems for list codes and codes with feedback.
IEEE Transactions on Information Theory,
Vol. 48,
Issue. 8,
p.
2153.
Guruswami, V.
Hastad, J.
Sudan, M.
and
Zuckerman, D.
2002.
Combinatorial bounds for list decoding.
IEEE Transactions on Information Theory,
Vol. 48,
Issue. 5,
p.
1021.
Metzner, J.J.
2003.
Vector symbol decoding with list inner symbol decisions.
IEEE Transactions on Communications,
Vol. 51,
Issue. 3,
p.
371.
Cai, N.
Winter, A.
and
Yeung, R. W.
2004.
Quantum privacy and quantum wiretap channels.
Problems of Information Transmission,
Vol. 40,
Issue. 4,
p.
318.
Cai, N.
Winter, A.
and
Yeung, R. W.
2004.
Quantum privacy and quantum wiretap channels.
Problems of Information Transmission,
Vol. 40,
Issue. 4,
p.
318.
Ahlswede, R.
and
Cai, N.
2005.
Search with noisy and delayed response.
Electronic Notes in Discrete Mathematics,
Vol. 21,
Issue. ,
p.
149.