• / 蔡宁 教授
    邮箱: ningcai@@shanghaitech.edu.cn
    电话:(021)20685376
    办公室: 信息学院1C-403.B室
    专业方向: 信息与通信工程
蔡宁 教授

电 话:(021)20685376
邮 箱:ningcai@@shanghaitech.edu.cn
办公室:信息学院1C-403.B室
个人主页: 
专业方向: 信息与通信工程
博士毕业院校: 德国比勒菲尔德大学

研究领域

  • 网络编码理论

  • 经典信息论

  • 量子信息论


个人简历

蔡宁于1982年在北京师范学院(现名首都师范大学)获得数学学士学位,1984年在中国科学院系统科学研究所获得数学硕士学位,1988年在德国比勒菲尔德大学(the University of Bielefeld)获得数学博士学位。从1989年到2005年,他在比勒菲尔德大学、新加坡国立大学和香港中文大学等高校从事研究工作。从2006年到2016年他在西安电子科技大学任特聘教授。他于2016年4月全职加入上海科技大学信息科学与技术学院任全职教授。他2008 年和2009年曾担任IEEE信息论学会评奖委员会(IEEE IT Society Awards Committee)委员,并于2006年担任IEEE信息论学报(IEEE Trans. on Information Theory)和IEEE/ACM网络学报(IEEE/ACM Trans. on Networking)联合特刊“网络与信息论”(Special Issue“Networking and Information Theory”)的客座编辑(guest editor). 他曾服务于多个信息论国际会议的各种组织委员会。他和李硕彦教授(S-Y. R. Li)和杨伟豪教授(R. W. Yeung)共同因论文“线性网络编码(Linear network coding)”获得2015年度IEEE信息论学会论文奖(the 2005 IEEE Information Theory Society Paper Award);他们还因为“在网络编码领域中的先驱性贡献(pioneering contributions to the field of network coding)”一起获得2016年度的IEEE Eric. E. Sumner奖(the 2016 IEEE Eric. E. Sumner Award)。他与合作者因论文“R, Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, Network information Flow”获得了2018 ACM SIGMOBILE Test-of-Time Paper Award奖。他是IEEE的fellow。他当前的研究兴趣包括了网络编码及经典和量子信息论。


代表性论文

  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 Transactions 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 Transactions on Information Theory, vol. 64, no. 10, pp. 6771-6778, 2018.

  3. N. Cai, “List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability”, IEEE Transactions on Information Theory, vol. 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, vol.59, pp. 3282-3294, 2013.

  7. N. Cai and T. Chan, “Theory of Secure Network Coding”, Proceedings of the IEEE, vol. 99, no. 3, pp. 421-437, March 2011.

  8. N. Cai and R. W. Yeung, “Secure Network Coding on a Wiretap Network”, IEEE Trans. on Information Theory. vol. 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, vol. 55, pp. 700-712, February 2009.

  10. R. Ahlswede and N. Cai, “An Interpretation of Identification Entropy”, IEEE Trans. on Information Theory, vol. 52, pp. 4198- 4207, 2006

  11. N. Cai, A. Winter and R. W. Yeung, “Quantum Privacy and Quantum Wiretap Channels”, Prob. of Information Trans. vol. 40, pp. 318-336, 2004.

  12. R. Ahlswede and N. Cai, “On Lossless Quantum Data Compression with a Classical Helper”, IEEE Trans. on Information Theory, vol. 50, pp. 1208-1219, 2004.

  13. N. Cai, L. Tolhuizen and H. Hollmann, “Common Coordinates in Consecutive Addresses”, IEEE Trans. on Information Theory, vol. 49, pp. 3308-3311, 2003.

  14. S.-Y. R. Li, R. W. Yeung, and N. Cai, “Linear Network Coding”, IEEE Trans. on Information Theory, vol.49, pp. 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, vol.48, pp. 2153-2162, 2002.

  16. R, Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, “Network Information Flow”, IEEE Trans. on Information Theory, vol. 46, pp. 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, vol. 45, no. 2, pp. 742-749, 1999; “Part 2. Correlated Sender's Side information, Correlated Messages, and Ambiguous Transmission”, IEEE Trans. on Information Theory, vol. 45, no. 2, pp. 749-756, 1999.

  18. R. Ahlswede and N. Cai, “A Counterexample to Kleitman's Conjecture Concerning an Edge-isoperimetric Problem”, Comb., Prob. & Comp., vol. 8, pp. 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 PaulErdős, Original Research Paper).

  20. R. Ahlswede and N. Cai, “General Edge-isoperimetric Inequalities: Part 1. Information- Theoretical Methods”, Europ. J. Combinatorics, vol. 18, pp. 355-372, 1997; “Part 2. A Local-global Principle for Lexicographical Solutions”, Europ. J. Combinatorics, vol. 18, pp. 479-489, 1997.

  21. R. A. Brualdi, N. Cai and V. S. Pless, “Orphan Structure of the First-order Reed-Muller codes”, Discrete Math, vol 102, pp. 239-247, 1992.

  22. R. Ahlswede and N. Cai, “Two Proofs of Pinsker’s Conjecture Concerning Arbitrarily Varying Channels”, IEEE Trans. on Information Theory, vol. 37, no. 6, pp. 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, vol 10, pp. 75-94, 1989.