## Biography:

Dr. Shenghao Yang received his B.S. degree from Nankai University in 2001, his M.S. degree from Peking University in 2004, and his Ph.D. degree in Information Engineering from The Chinese University of Hong Kong (CUHK) in 2008. He was a Postdoctoral Fellow in the University of Waterloo from 2008 to 2009 and in the Institute of Network Coding, CUHK from 2010 to 2012. He was with the Tsinghua University from 2012 to 2015 as an Assistant Professor.

Dr. Yang’s research interests include network coding, information theory, coding theory, network computation and quantum information. He has published more than 30 papers in international journals and conferences, including IEEE Transactions on Information Theory. He is the co-inventor of BATS codes and has two US patents granted.

## Academic Publications:

1. 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, Apr. 2016.

2. S. Yang and Q. Zhou, “Tree Analysis of BATS Codes,” IEEE Communications Letters, vol. 20, no. 1, pp. 37–40, Jan. 2016.

3. B. Tang, S. Yang, B. Ye, S. Guo, and S. Lu, “Near-optimal One-sided Scheduling for Coded Segmented Network Coding,” Computers, IEEE Transactions on, vol. 65, no. 3, pp. 929–939, Mar. 2016.

4. B. Tang, S. Yang, Y. Yin, B. Ye, and S. Lu, “Expander Chunked Codes,” EURASIP Journal on Advances in Signal Processing, vol. 2015, no. 1, pp. 1–13, 2015.

5. S. Yang, S.-W. Ho, J. Meng, and E.-H. Yang, “Capacity Analysis of Linear Operator Channels Over Finite Fields,” Information Theory, IEEE Transactions on, vol. 60, no. 8, pp. 4880–4901, Aug. 2014.

6. S. Yang and R. W. Yeung, “Batched Sparse Codes,” Information Theory, IEEE Transactions on, vol. 60, no. 9, pp. 5322–5346, Sep. 2014.

7. A. A. Gohari, S. Yang, and S. Jaggi, “Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding With Correlated Sources,” Information Theory, IEEE Transactions on, vol. 59, no. 9, pp. 5708–5722, Sep. 2013.

8. Y. Chen, S. Yang, and W. S. Wong, “Exact Non-Gaussian Interference Model for Fading Channels,” Wireless Communications, IEEE Transactions on, vol. 12, no. 1, pp. 168–179, Jan. 2013.

9. S. Yang, R. W. Yeung, and C. K. Ngai, “Refined Coding Bounds and Code Constructions for Coherent Network Error Correction,” Information Theory, IEEE Transactions on, vol. 57, no. 3, pp. 1409–1424, Mar. 2011.

10. S. Yang, R. W. Yeung, and Z. Zhang, “Weight Properties of Network Codes,” Telecommunications, European Transactions on, vol. 19, no. 4, pp. 371–383, 2008.

**Conference Papers**

1. H. H. F. Yin, S. Yang, Q. Zhou, and L. M. L. Yung, “Adaptive Recoding for BATS Codes,” in Information Theory Proceedings (ISIT), 2016 IEEE International Symposium on, 2016, pp. 2349–2353.

2. B. Tang and S. Yang, “An Improved Design of Overlapped Chunked Codes,” in Communications Proceedings (ICC), 2016 IEEE International Conference on, 2016, pp. 1–6.

3. S. Yang and R. W. Yeung, “Further Results on Finite-Length Analysis of BATS Codes,” in Global Communications Conference Proceedings (Globecom), 2016 IEEE, 2016.

4. X. Guang, S. Yang, and C. Li, “An Improved Upper Bound on Network Function Computation Using Cut-Set Partition,” in Information Theory Workshop (ITW), 2016 IEEE, 2016, pp. 11–15.

5. X. Fu, Z. Xiao, and S. Yang, “Overhead-free In-place Recovery and Repair Schemes of XOR-based Regenerating Codes,” in Information Theory Proceedings (ISIT), 2015 IEEE International Symposium on, 2015.

6. C. Huang, Z. Tan, and S. Yang, “Upper Bound on Function Computation in Directed Acyclic Networks,” in Information Theory Workshop (ITW), 2015 IEEE, 2015.

7. S. Yang, Y. Chen, S.-C. Liew, and L. You, “Coding for network-coded slotted ALOHA,” in Information Theory Workshop (ITW), 2015 IEEE, 2015.

8. Z. Zhang and S. Yang, “An Intrinsic Relation between Secure Network coding and Network Error Correction,” in Chinacom 2015, Shanghai, China, 2015.

9. S. Yang, R. W. Yeung, H. F. Cheung, and H. H. F. Yin, “BATS: Network coding in action,” in Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on, 2014, pp. 1204–1211.

10. X. Fu, Z. Xiao, and S. Yang, “Overhead-Free In-Place Recovery Scheme for XOR-Based Storage Codes,” in Trust, Security and Privacy in Computing and Communications (TrustCom), 2014 IEEE 13th International Conference on, 2014, pp. 552–557.

11. S. Yang, S. C. Liew, L. You, and Y. Chen, “Linearly-coupled fountain codes for network-coded multiple access,” in Information Theory Workshop (ITW), 2014 IEEE, 2014, pp. 481–485.

12. S. Yang and B. Tang, “From LDPC to chunked network codes,” in Information Theory Workshop (ITW), 2014 IEEE, 2014, pp. 406–410.

13. C. T. Li, S. Yang, and R. W. Yeung, “Multi-rate sequential data transmission,” in Information Theory and Applications Workshop (ITA), 2013, 2013, pp. 1–2.

14. C. T. Li, S. Yang, and R. W. Yeung, “Multi-rate sequential data transmission,” in Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, 2013, pp. 1007–1011.

15. T.-C. Ng and S. Yang, “Finite-length analysis of BATS codes,” in Network Coding (NetCod), 2013 International Symposium on, 2013, pp. 1–6.

16. S. Yang, “Superposition coding for linear operator channels over finite fields,” in Information Theory Workshop (ITW), 2012 IEEE, Lausanne, Switzerland, 2012, pp. 502–506.

17. M. J. Siavoshani, S. Yang, and R. W. Yeung, “Non-coherent network coding: An arbitrarily varying channel approach,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, Cambridge, MA, USA, 2012, pp. 1672–1676.

18. B. Tang, S. Yang, Y. Yin, B. Ye, and S. Lu, “Expander graph based overlapped chunked codes,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, Cambridge, MA, USA, 2012, pp. 2451–2455.

19. S. Yang and R. W. Yeung, “Large File Transmission in Network-Coded Networks with Packet Loss – A Performance Perspective,” in Proc. ACM ISABEL 2011, Barcelona, Spain, 2011.

20. A. A. Gohari, S. Yang, and S. Jaggi, “Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, Saint Petersburg, Russia, 2011, pp. 598–602.

21. S. Yang and R. W. Yeung, “Coding for a network coded fountain,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, Saint Petersburg, Russia, 2011, pp. 2647–2651.

22. S. Yang, S.-W. Ho, J. Meng, and E.-hui Yang, “Optimality of subspace coding for linear operator channels over finite fields,” in Information Theory Workshop (ITW), 2010 IEEE, Cario, Egypt, 2010, pp. 1–5.

23. S. Yang, J. Meng, and E.-hui Yang, “Coding for linear operator channels over finite fields,” in Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, Austin, USA, 2010, pp. 2413–2417.

24. Z. Zhang, S. Yang, and C.-K. Ngai, “A nested code approach for erroneous wiretap networks,” in Information Theory Workshop (ITW), 2010 IEEE, Cario, Egypt, 2010, pp. 1–5.

25. S. Yang, R. W. Yeung, and Z. Zhang, “Characterization of error correction and detection in a general transmission system,” in Information Theory, 2008. ISIT 2008. IEEE International Symposium on, Toronto, Canada, 2008, pp. 812–816.

26. C.-K. Ngai and S. Yang, “Deterministic Secure Error-Correcting (SEC) Network Codes,” in Information Theory Workshop, 2007. ITW ’07. IEEE, Lake Tahoe, USA, 2007, pp. 96–101.

27. C.-K. Ngai, S. Yang, and R. W. Yeung, “On Static Code Construction for Alternating Multicast and Simultaneous Multicasts,” in Global Telecommunications Conference, 2007. GLOBECOM ’07. IEEE, Washinton, DC, USA, 2007, pp. 1437–1440.

28. S. Yang and R. W. Yeung, “Refined Coding Bounds for Network Error Correction,” in Proc. IEEE Information Theory Workshop ITW ’07, Bergen, Norway, 2007, pp. 1–5.

29. S. Yang and R. W. Yeung, “Characterizations of Network Error Correction/Detection and Erasure Correction,” in Proc. Netcod Workshop 2007, San Diego, USA, 2007.

30. S. Yang, C. K. Ngai, and R. W. Yeung, “Construction of Linear Network Codes that Achieve a Refined Singleton Bound,” in Information Theory, 2007. ISIT 2007. IEEE International Symposium on, Nice, France, 2007, pp. 1576–1580.