EN
Biography

Shenghao Yang holds a B.S. degree from Nankai University (2001), an M.S. degree from Peking University (2004), and a Ph.D. in information engineering from The Chinese University of Hong Kong (2008). He was a Visiting Student at the Department of Informatics, University of Bergen, Norway, in Spring 2017. He served as a Post-Doctoral Fellow at the University of Waterloo from 2008 to 2009 and at the Institute of Network Coding, The Chinese University of Hong Kong, from 2010 to 2012. From 2012 to 2015, he was affiliated with the Institute for Interdisciplinary Information Sciences, Tsinghua University. Since 2015, he has been with The Chinese University of Hong Kong, Shenzhen, where he currently serves as an Associate Professor. His research interests span network coding, information theory, coding theory, and quantum information.

Publications
  1. S. Yang, J. Ma, and Y. Liu, “Wireless network scheduling with discrete propagation delays: Theorems and algorithms,” IEEE Transactions on Information Theory, vol. 70, no. 3, pp. 1852–1875, 2024.
  2. S. Yang and R. W. Yeung, “Network communication protocol design from the perspective of batched network coding,” IEEE Communications Magazine, vol. 60, no. 1, pp. 89–93, 2022.
  3. J. Ma, Y. Liu, and S. Yang, “Rate region of scheduling a wireless network with discrete propagation delays,” in INFOCOM’21, 2021.
  4. X. Fu, S. Yang, and Z. Xiao, “Decoding and repair schemes for shift-xor regenerating codes,” IEEE Transactions on Information Theory, vol. 66, no. 12, pp. 7371–7386, 2020.
  5. X. Guang, R. W. Yeung, S. Yang, and C. Li, “Improved upper bound on the network function computing capacity,” IEEE Transactions on Information Theory, vol. 65, no. 6, pp. 3790–3811, 2019.
  6. C. Huang, Z. Tan, S. Yang, and X. Guang, “Comments on cut-set bounds on network function computation,” IEEE Transactions on Information Theory, vol. 64, no. 9, pp. 6454–6459, 2018.
  7. S. Yang, T. C. Ng, and R. W. Yeung, “Finite-length analysis of BATS codes,” IEEE Transactions on Information Theory, vol. 64, no. 1, pp. 322–348, 2018.
  8. S. Yang and R. W. Yeung, BATS Codes: Theory and Practice (Synthesis Lectures on Communication Networks). Morgan & Claypool Publishers, 2017.
  9. Y. Teng, S. Yang, S. Wang, and M. Zhao, “Tight bound on randomness for violating the Clauser-Horne-Shimony- Holt inequality,” IEEE Transactions on Information Theory, vol. 62, no. 4, pp. 1748–1757, 2016.
  10. S. Yang and R. W. Yeung, “Batched sparse codes,” IEEE Transactions on Information Theory, vol. 60, no. 9, pp. 5322– 5346, 2014.
  11. A. A. Gohari, S. Yang, and S. Jaggi, “Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources,” IEEE Transactions on Information Theory, vol. 59, no. 9, pp. 5708–5722, 2013.
  12. S. Yang, R. W. Yeung, and C. K. Ngai, “Refined coding bounds and code constructions for coherent network error correction,” IEEE Transactions on Information Theory, vol. 57, no. 3, pp. 1409–1424, 2011.