The SCEAS System
| |||||||

## Search the dblp DataBase
Ning Cai:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Rudolf Ahlswede, Ning Cai
**Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs.**[Citation Graph (0, 0)][DBLP] GTIT-C, 2006, pp:979-1005 [Conf] - Ning Cai
**Private Capacity of Broadcast Channels.**[Citation Graph (0, 0)][DBLP] GTIT-C, 2006, pp:1076-1078 [Conf] - Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang
**Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer.**[Citation Graph (0, 0)][DBLP] GTIT-C, 2006, pp:285-292 [Conf] - Rudolf Ahlswede, Ning Cai
**Watermarking Identification Codes with Related Topics on Common Randomness.**[Citation Graph (0, 0)][DBLP] GTIT-C, 2006, pp:107-153 [Conf] - Rudolf Ahlswede, Ning Cai
**Codes with the Identifiable Parent Property and the Multiple-Access Channel.**[Citation Graph (0, 0)][DBLP] GTIT-C, 2006, pp:249-257 [Conf] - Rudolf Ahlswede, Ning Cai
**Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder.**[Citation Graph (0, 0)][DBLP] GTIT-C, 2006, pp:258-275 [Conf] - Rudolf Ahlswede, Ning Cai
**A Strong Converse Theorem for Quantum Multiple Access Channels.**[Citation Graph (0, 0)][DBLP] GTIT-C, 2006, pp:460-485 [Conf] - Rudolf Ahlswede, Ning Cai
**Search with Noisy and Delayed Responses.**[Citation Graph (0, 0)][DBLP] GTIT-C, 2006, pp:695-703 [Conf] - Rudolf Ahlswede, Ning Cai
**A Kraft-Type Inequality for d-Delay Binary Search Codes.**[Citation Graph (0, 0)][DBLP] GTIT-C, 2006, pp:704-706 [Conf] - Rudolf Ahlswede, Ning Cai
**Rank Formulas for Certain Products of Matrices.**[Citation Graph (0, 0)][DBLP] Appl. Algebra Eng. Commun. Comput., 1993, v:4, n:, pp:253-261 [Journal] - Rudolf Ahlswede, Ning Cai
**A generalization of the AZ identity.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1993, v:13, n:3, pp:241-248 [Journal] - Rudolf Ahlswede, Ning Cai
**Shadows and Isoperimetry Under the Sequence-Subsequence Relation.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1997, v:17, n:1, pp:11-29 [Journal] - Rudolf Ahlswede, Ning Cai, Zhen Zhang
**Diametric theorems in seuence spaces.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1992, v:12, n:1, pp:1-17 [Journal] - Rudolf Ahlswede, Ning Cai
**On Extremal Set Partitions in Cartesian Product Spaces.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:211-220 [Journal] - Rudolf Ahlswede, Ning Cai
**On Partitioning and Packing Products with Rectangles.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1994, v:3, n:, pp:429-434 [Journal] - Rudolf Ahlswede, Ning Cai
**A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1999, v:8, n:4, pp:- [Journal] - Rudolf Ahlswede, Ning Cai
**Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1996, v:17, n:8, pp:677-687 [Journal] - Rudolf Ahlswede, Ning Cai
**General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1997, v:18, n:4, pp:355-372 [Journal] - Rudolf Ahlswede, Ning Cai
**General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1997, v:18, n:5, pp:479-489 [Journal] - Rudolf Ahlswede, Ning Cai
**Models of Multi-User Write-Efficient Memories and General Diametric Theorems.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1997, v:135, n:1, pp:37-67 [Journal] - Ning Cai, Kwok-Yan Lam
**On identification secret sharing schemes.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2003, v:184, n:2, pp:298-310 [Journal] - Rudolf Ahlswede, Ning Cai
**Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:742-749 [Journal] - Rudolf Ahlswede, Ning Cai
**Information and Control: Matching Channels.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:542-563 [Journal] - Rudolf Ahlswede, Ning Cai
**Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:749-756 [Journal] - Rudolf Ahlswede, Bernhard Balkenhol, Ning Cai
**Parallel error correcting codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:959-962 [Journal] - Rudolf Ahlswede, Ning Cai
**Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2153-2162 [Journal] - Rudolf Ahlswede, Ning Cai
**On Lossless Quantum Data Compression With a Classical Helper.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1208-1219 [Journal] - Rudolf Ahlswede, Ning Cai
**Two proofs of Pinsker's conjecture concerning arbitrarily varying channels.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1647-0 [Journal] - Rudolf Ahlswede, Ning Cai
**Identification without randomization.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2636-2642 [Journal] - Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, Raymond W. Yeung
**Network information flow.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1204-1216 [Journal] - Rudolf Ahlswede, Ning Cai, Zhen Zhang
**Erasure, list, and detection zero-error capacities for low noise and a relation to identification.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:55-62 [Journal] - Rudolf Ahlswede, Ning Cai
**On communication complexity of vector-valued functions.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:2062-0 [Journal] - Rudolf Ahlswede, Ning Cai, Zhen Zhang
**On interactive communication.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:22-37 [Journal] - Rudolf Ahlswede, Ning Cai, Zhen Zhang
**Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1250-1252 [Journal] - Rudolf Ahlswede, Ning Cai
**Correlated sources help transmission over an arbitrarily varying channel.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1254-1255 [Journal] - Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, Rayadurgam Srikant, Donald F. Towsley, Raymond W. Yeung
**Introduction to the special issue on networking and information theory.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2285-2288 [Journal] - Ning Cai, Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann
**Common coordinates in consecutive addresses.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3308-3312 [Journal] - Shuo-Yen Robert Li, Raymond W. Yeung, Ning Cai
**Linear network coding.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:2, pp:371-381 [Journal] - Lihua Song, Richard W. Yeung, Ning Cai
**Zero-error network coding for acyclic network.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3129-3139 [Journal] - Lihua Song, Richard W. Yeung, Ning Cai
**A separation theorem for single-source network coding.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:5, pp:1861-1871 [Journal] - Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, R. Srikant, Donald F. Towsley, Raymond W. Yeung
**Introduction to the special issue on networking and information theory.**[Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2006, v:14, n:4, pp:674- [Journal] - Richard A. Brualdi, Ning Cai, Vera Pless
**Orphan structure of the first-order Reed-Muller codes.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:102, n:3, pp:239-247 [Journal] **Analysis on the Multi-system Collaborative Model of the Enterprise Circular Economy - A Case Study of Hangzhou Iron & Steel Group in China.**[Citation Graph (, )][DBLP]**Robust Key Agreement Schemes**[Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.010secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |