Source: http://sist.shanghaitech.edu.cn/2018/0502/c2739a24329/page.htm
Timestamp: 2019-04-23 10:40:55+00:00

Document:
1.H. Boche, M. Cai, and N. Cai, Message Transmission over Classical Quantum Channels with a Jammer with Side Information, Correlation as Resource and Common Randomness Generating, to appear in IEEE Trans. on Information Theory.
2.Q. Cao, N. Cai, W. Guo and R. W. Yeung, On Zero-Error Capacity of Binary Channels with One Memory, IEEE Trans. Information Theory, v.64, no. 10, pp. 6771-6778, 2018.
3.N. Cai, List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability, IEEE Trans. Information Theory, v.62, no. 11, pp. 6059-6110, 2016.
4.H. Boche, N. Cai and J. Nőetzel, The Classical-quantum Channel with Random State Parameters Known to the Sender, J. Phys. A: Math. Theor. 49 (2016) 195302 (29 pp), 2016.
5.H. Boche, M. Cai, N. Cai, and C. Deppe, Secrecy Capacities of Compound Quantum Wiretap Channels and Applications, PHYSICAL REVIEW A 89, 052320, 2014.
6.N. Cai, Localized Error Correction in Projective Space, IEEE Trans. Information Theory, v.59, pp. 3282-3294, 2013.
8.N. Cai and R. W. Yeung, Secure Network Coding on a Wiretap Network, IEEE Trans. on Information Theory. V. 57, No. 1, pp 424-435, JANUARY 2011.
9.R. W. Yeung, N. Cai, S.-W. Ho and A. B. Wagner, Reliable Communication in the Absence of a Common Clock IEEE Trans. Information Theory, V. 55, 700-712, Feb 2009.
11.N. Cai, A. Winter and R. W. Yeung, Quantum Privacy and Quantum Wiretap Channels, Prob. of Information Trans. V. 40, 318-336, 2004.
12.R. Ahlswede and N. Cai, On Lossless Quantum Data Compression with a Classical Helper, IEEE Trans. on Information Theory, V. 50, 1208-1219, 2004.
13.N. Cai, L. Tolhuizen and H. Hollmann, Common Coordinates in Consecutive Addresses, IEEE Trans. on Information Theory, V. 49, 3308-3311, 2003.
14.S.-Y. R. Li, R. W. Yeung, and N. Cai Linear Network Coding, IEEE Trans. on Information Theory. V.49, 371-381, 2003 (awarded paper).
15.R. Ahlswede and N. Cai, Semi-noisy Deterministic Multiple Access Channels: Coding Theorems for List codes and Codes with Feedback, IEEE Trans. on Information Theory, V.48, 2153-2162, 2002.
16.R, Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, Network Information Flow, IEEE Trans. on Information Theory, V. 46, 1204-1216, 2000 (awarded paper).
17.R. Ahlswede and N. Cai, Arbitrarily Varying Multiple-access channels: Part 1. Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True, IEEE Trans. on Information Theory, V. 45, No. 2, 742-749, 1999; Part 2. Correlated Sender's Side information, Correlated Messages, and Ambiguous Transmission, IEEE Trans. on Information Theory, V. 45, No. 2, 749-756, 1999.
18.R. Ahlswede and N. Cai, A Counterexample to Kleitman's Conjecture Concerning an Edge-isoperimetric Problem, Comb., Prob. & Comp., V. 8, 301-305,1999 .
19.R. Ahlswede and N. Cai, Cross-Disjoint Pairs of Clouds in the Interval Lattice, The Mathematics of Paul Erdős, Algorithms and Combinatorics 13, R. L. Graham and J. Nesetril (eds.),155-Springer, 1997 (Invited Paper in Honor of Paul Erdős, Original Research Paper).
20.R. Ahlswede and N. Cai, General Edge-isoperimetric Inequalities: Part 1. Information- Theoretical Methods, Europ. J. Combinatorics, V. 18, 355-372, 1997; Part 2. A Local-global Principle for Lexicographical Solutions, Europ. J. Combinatorics, V. 18, 479-489, 1997.
21.R. A. Brualdi, N. Cai and V. S. Pless, Orphan Structure of the First-order Reed-Muller codes, Discrete Math. 102, 239-247, 1992.
22.R. Ahlswede and N. Cai Two Proofs of Pinsker's Conjecture Concerning Arbitrarily Varying Channels, IEEE Trans. on Information Theory V. 37, No. 6, 1647-1649, 1991.
23.R. Ahlswede, N. Cai and Z. Zhang A General 4-words Inequality with Consequences for 2-Way Communication Complexity, Advances in Applied Math. 10, 75-94, 1989.

References: V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V.