Publication of Chih-Chun Wang

The permission for the use of the papers in this page is granted in accordance with the publishers’ copyrights.

The accepted version is the result of the last iteration of the review process but does not include any copy-editing, proofreading and formatting added by IEEE. Therefore, the accepted version is not identical to the published version as some cosmetic changes may apply.

When possible, a direct link to IEEE Xplore will be provided for direct access of the paper.

Last update: March 2024.

Serial Journal Referred Articles:

2024

41. E. Ruzomberka, C.-C. Wang, and D.J. Love “Channel Capacity for Adversaries With Computationally Bounded Observations” IEEE Transactions on Information Theory, vol. 70, no. 1, pp. 75-92, January 2024. (final accepted version) (direct link).

42. C.-C. Wang, “Optimal AoI for Systems With Queueing Delay in Both Forward and Backward Directions” IEEE/ACM Transactions on Networking, accepted for publication in March 2024. (final accepted version) (longer version with proofs) (direct link).

2023

37. C.-H. Tsai and C.-C. Wang, “Distribution-oblivious Online Algorithms for Age-of-Information Penalty Minimization” IEEE/ACM Transactions on Networking, vol. 31, no. 4, pp. 1779-1794, August 2023. (final accepted version) (longer version with proofs) (direct link).

38. D. Ogbe, C.-C. Wang, and D.J. Love, “On The Optimal Delay Growth Rate of Multi-hop Line Networks: Asymptotically Delay-Optimal Designs And The Corresponding Error Exponents” IEEE Transactions on Information Theory, vol. 69, no. 10, pp. 6167-6193, October 2023. (final accepted version) (direct link).

39. E. Ruzomberka, D. Love, C. Brinton, A. Gupta, C. Wang, and H. V. Poor, “Challenges and Opportunities for Beyond-5G Wireless Security” IEEE Security & Privacy, vol. 21, no. 5, pp. 55-66, September-October 2023. (final accepted version) (direct link).

40. M. Bliss, C.-C. Wang, and D.J. Love, “Optimal Single-Bit Relaying Strategies with Multi-Relay Diversity” IEEE Transactions on Information Theory, vol. 69, no. 10, pp. 6518-6536, October 2023. (final accepted version) (direct link).

2022

33. C.-H. Tsai and C.-C. Wang, “Unifying AoI Minimization and Remote Estimation — Optimal Sensor/Controller Coordination with Random Two-way Delay” IEEE/ACM Transactions on Networking, vol. 30, no. 1, pp. 229-242, February 2022. (final accepted version) (direct link).

34. V. Suresh, E. Ruzomberka, C.-C. Wang and D.J. Love, “Causal Adversarial Channels with Feedback Snooping” IEEE Journal on Selected Areas in Information Theory, vol. 3, no. 1, pp. 69-84, March 2022. (final accepted version) (direct link).

35. P.-W. Su, Y.-C. Huang, S.-C. Lin, I.-H. Wang, and C.-C. Wang, “Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime — Part I: Exact Analysis”, IEEE Transactions on Information Theory, vol. 68, no. 10, pp. 6356-6387, October 2022. (final accepted version) (direct link).

36. C.-H. Chang, B. Peleato, and C.-C. Wang, “Coded Caching with Full Heterogeneity: Exact Capacity of The Two-User/Two-File Case,” IEEE Transactions on Information Theory, vol. 68, no. 11, pp. 7060-7076, November 2022. (final accepted version) (direct link).

2020

32. C.-H. Chang and C.-C. Wang, “A New Capacity-Approaching Scheme for General 1-to-K Broadcast Packet Erasure Channels with ACK/NACK” IEEE Transactions on Information Theory, vol. 66, no. 5, pp. 3000-3025, May 2020. (final accepted version) (direct link).

2018

29. I. Ahmad and C.-C. Wang, “When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks?” IEEE Transactions on Information Theory, vol. 64, no. 3, pp. 2142-2171, March 2018. (final accepted version) (direct link).

30. I. Ahmad and C.-C. Wang, “Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair,” IEEE Transactions on Information Theory, vol. 64, no. 5, pp. 3493-3512, May 2018. (final accepted version) (direct link).

31. S. Kamath, V. Anantharam, D. Tse, and C.-C. Wang, “The Two-Unicast Problem,” IEEE Transactions on Information Theory, vol. 64, no. 5, pp. 3865-3882, May 2018. (final accepted version) (direct link)

2017

25. C.-C. Wang and M. Chen, “Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast,” IEEE Transactions on Information Theory, vol. 63, no. 1, pp. 252-279, January 2017. (final accepted version) (direct link)

26. W.-C. Kuo and C.-C. Wang, “Robust and Optimal Opportunistic Scheduling for Downlink Two-Flow Network Coding With Varying Channel Quality and Rate Adaptation,” IEEE/ACM Transactions on Networking, vol. 25, no. 1, pp. 465-479, February 2017. (final accepted version) (direct link)

27. X. Li, C.-C. Wang, and X. Lin “Inter-Session Network Coding Schemes for 1-to-2 Downlink Access-Point Networks With Sequential Hard Deadline Constraints,” IEEE/ACM Transactions on Networking, vol. 25, no. 1, pp. 624-638, February 2017. (final accepted version) (direct link)

28. L. Deng, C.-C. Wang, M. Chen, and S. Zhao, “Timely Wireless Flows with General Traffic Patterns: Capacity Region and Scheduling Algorithms,” IEEE/ACM Transactions on Networking, vol. 25, no. 6, pp. 3473-3486, September 2017. (final accepted version) (direct link).

2016

23. D. Shin, S. Bagchi, and C.-C. Wang, “Toward Optimal Distributed Monitoring of Multi-Channel Wireless Networks,” IEEE Transactions on Mobile Computing, vol. 15, no. 7, pp. 1826-1838, June 2016. (final accepted version) (direct link)

24. J. Han and C.-C. Wang, “General Capacity Region For The Fully-Connected 3-node Packet Erasure Network,” IEEE Transactions on Information Theory, vol. 62, no. 10, pp. 5503-5523, October 2016. (final accepted version) (direct link)

2015

22. Z. Ahmad, Z. Chance, D.J. Love, and C.-C. Wang, “Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels with Noisy Channel Output Feedback,” IEEE Transactions on Communications, vol. 63, no. 11, pp. 4576-4590, November 2015. (final accepted version) (direct link)

2014

21. C.-C. Wang and J. Han, “The Capacity Region of Two-Receiver Multiple-Input Broadcast Packet Erasure Channels With Channel Output Feedback,” IEEE Transactions on Information Theory, vol. 60, no. 9, pp. 5597-5626, September 2014. (final accepted version) (direct link)

2013

19. P.-K. Huang, X. Lin, and C.-C. Wang, “A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks With Order-Optimal Per-Flow Delay,” IEEE/ACM Transactions on Networking, vol. 21, no. 2, pp. 495-508, April 2013. (final accepted version) (direct link)

20. W.-C. Kuo and C.-C. Wang, “Two-Flow Capacity Region Of The COPE Principle For Two-Hop Wireless Erasure Networks”, IEEE Transactions on Information Theory, vol. 59, no. 11, pp. 7553-7575, November 2013. (final accepted version) (direct link)

2012

15. C.-C. Wang, “On The Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback,” IEEE Transactions on Information Theory, vol. 58, no. 2, pp. 931-956, February 2012. (final accepted version) (direct link)

16. C.-C. Wang, “On the Capacity of Wireless 1-Hop Intersession Network Coding – A Broadcast Packet Erasure Channel Approach,” IEEE Transactions on Information Theory, vol. 58, no. 2, pp. 957-988, February 2012. (final accepted version) (direct link)

17. G.B. Kyung and C.-C. Wang, “Finding The Exhaustive List of Small Fully Absorbing Sets and Designing The Corresponding Low Error-Floor Decoder,” IEEE Transactions on Communications, vol. 60, no. 6, pp. 1487-1498, June 2012. (final accepted version) (direct link)

18. D. Koutsonikolas, Y.-C. Hu, and C.-C. Wang, “Pacifier: High-Throughput, Reliable Multicast Without Crying Babies in Wireless Mesh Networks,” IEEE/ACM Transactions of Networking, vol. 20, no. 5, pp. 1375-1388, October 2012. (final accepted version) (direct link)

2011

11. G.B. Kyung and C.-C. Wang, “Towards a Practical Scheme for Binary Broadcast Channels with Varying Channel Quality Using Dirty Paper Coding,” IEEE Transactions on Communications, vol. 59, no. 4, pp. 1009-1018, April 2011. (final accepted version) (direct link)

12. X. Li, C.-C. Wang, and X. Lin, “On The Capacity of Immediately-Decodable Coding Schemes for Wireless Stored-video Broadcast with Hard Deadline Constraints,” IEEE Journals on Selected Areas of Communication, vol. 29, no. 5, pp. 1094-1105, May 2011. (final accepted version) (direct link)

13. D. Koutsonikolas, Y.C. Hu, and C.-C. Wang, “Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgment,” IEEE/ACM Transactions on Networking, vol. 19, no. 5, pp. 1368-1381, October 2011. (final accepted version) (direct link)

14. D. Koutsonikolas, C.-C. Wang, Y.-C. Hu, and N.B. Shroff, “FEC-Based AP Downlink Transmission Schemes For Multiple Flows: Combining The Reliability and Throughput Enhancement of Intra- and Inter-flow Coding,” Elsevier Perfomance Evaluation (PEVA), vol. 68, no. 11, pp. 1118-1135, November 2011. (final accepted version) (direct link)

2010

8. C.-C. Wang, “Pruning Network Coding Traffic By Network Coding --- A New Class of Max-Flow Algorithms,” IEEE Transactions on Information Theory, vol. 56, no. 4, pp. 1909-1929, April 2010. (final accepted version) (direct link)

9. A. Khreishah, C.-C. Wang, and N.B. Shroff, “Rate Control with Pairwise Inter-session Network Coding,” IEEE/ACM Transactions on Networking, vol. 18, no. 3, pp. 816 – 829, June 2010. (final accepted version) (direct link)

10. C.-C. Wang and Ness B. Shroff, “Pairwise Intersession Network Coding On Directed Networks,” IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3879—3900, August 2010. (final accepted version) (direct link)

2009

6. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “Finding All Small Error-Prone Substructures in LDPC Codes,” IEEE Transactions on Information Theory, vol. 55, no. 5, pp. 1976 – 1999, May 2009. (pdf) (direct link)

7. A. Khreishah, C.-C. Wang, and N.B. Shroff, “Cross-layer Optimization for Wireless Multihop Networks with Pairwise Intersession Network Coding,” IEEE Journal on Selected Areas in Communications, vol. 27, no. 5, pp. 606 – 621, June 2009. (pdf) (direct link)

2008

5. D. Guo, C.-C. Wang, “Multiuser Detection of Sparsely Spread CDMA,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 3, pp. 421 – 431, April 2008. (pdf) (direct link)

2007

4. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “Finite-dimensional bounds on Zm and binary LDPC codes with belief propagation decoders,” IEEE Transactions on Information Theory, vol. 53, no. 1, pp. 56 – 81, January 2007. (pdf) (direct link)

2005

1. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “Density evolution for asymmetric memoryless channels," IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4216 - 4236, December 2005. (pdf) (direct link)

2. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “Arbitrary side observations in bandit problems,” Advances in Applied Mathematics, special issue dedicated to Dr. David P. Robbins, vol. 34, no. 4, pp. 903 - 938, May 2005. (pdf) (direct link).

3. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “Bandit problems with side observations,” IEEE Transactions on Automatic Control, vol. 50, no. 5, pp. 338 - 355, May 2005. (pdf) (direct link)

Technical Reports:

P1. D. Koutsonikolas, Y.C. Hu and C.-C. Wang, “TR ECE 08-11: An Empirical Study of Performance Benefits of Network Coding in Multihop Wireless Networks,” 2008. http://docs.lib.purdue.edu/ecetr/380/

P2. D. Koutsonikolas, C.-C. Wang, and Y.C. Hu, “TR-ECE-09-13: CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments,” 2009.
http://docs.lib.purdue.edu/ecetr/394/

P3. S.H. Sellke, C.-C. Wang, S. Bagchi, and N.B. Shroff, “TR-ECE-09-14: Camouflaging Timing Channels in Web Traffic,” 2009. http://docs.lib.purdue.edu/ecetr/393/

P4. D. Koutsonikolas, C.-C. Wang, Y.C. Hu, and N.B. Shroff, “TR-ECE-06-05, Designing an Efficient Retransmission Scheme for Wireless LANs: Theory and Implementation,” 2010.
http://docs.lib.purdue.edu/ecetr/401/

P5. X. Li, C.-C. Wang, and X. Lin, “TR-ECE-10-04: Throughput and Delay Analysis on Uncoded and Coded Wireless Broadcast with Hard Deadline Constraints,” 2010. http://docs.lib.purdue.edu/ecetr/398/

P6. D. Koutsonikolas, C.-C. Wang, Y.C. Hu, and N.B. Shroff, “TR-ECE-10-05, Designing an Efficient Retransmission Scheme for Wireless LANs: Theory and Implementation,” 2010.
http://docs.lib.purdue.edu/ecetr/400/

P7. X. Li, C.-C. Wang, and X. Lin, “TR-ECE-10-11, On The Capacity of Immediately-Decodable Coding Schemes for Wireless Stored-video Broadcast with Hard Deadline Constraints,” 2010.
http://docs.lib.purdue.edu/ecetr/406/

P8. X. Li, C.-C. Wang, and X. Lin, “TR-ECE-11-17, Optimal Immediately-Decodable Inter-session Network Coding (IDNC) Schemes for Two Unicast Sessions with Hard Deadline Constraints,” 2011.
http://docs.lib.purdue.edu/ecetr/423/

P9. D. Shin, S. Bagchi, and C.-C. Wang, “TR-ECE-12-01: Distributed Online Channel Assignment Toward Optimal Monitoring in Multi-Channel Wireless Networks,” 2012.
http://docs.lib.purdue.edu/ecetr/427/

P10. X. Li, C.-C. Wang, and X. Lin, “TR-ECE-12-06, Inter-Session Network Coding Schemes for Two Unicast Sessions with Sequential Hard Deadline Constraints,” 2012.
http://docs.lib.purdue.edu/ecetr/432/

P11. P.-K. Huang, X. Lin, and C.-C. Wang, “TR-ECE-12-07, A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay,” 2012.
http://docs.lib.purdue.edu/ecetr/433/

P12. X. Li, X. Tang, C.-C. Wang, and X. Lin, “TR-ECE-13-01, Gibbs-Sampling-based Optimization for the Deployment of Small Cells in 3G Heterogeneous Networks,” 2013.
http://docs.lib.purdue.edu/ecetr/440/

P13. J. Han, C.-C. Wang, and N.B. Shroff, “TR-ECE-14-04, Graph-Theoretic Characterization of the Feasibility of the Precoding-Based 3-Unicast Interference Alignment Scheme,” 2014.
http://docs.lib.purdue.edu/ecetr/457/

P14. J. Han and C.-C. Wang, “TR-ECE-14-06: Optimal Linear Network Coding When 3 Nodes Communicate Over Broadcast Erasure Channels with ACK,” 2014.
http://docs.lib.purdue.edu/ecetr/459/

P15. W.-C. Kuo and C.-C. Wang, “TR-ECE-14-08: Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation”, 2014.
http://docs.lib.purdue.edu/ecetr/462/

P16. C.-H. Tsai and C.-C. Wang, “TR-ECE: Unifying AoI Minimization and Remote Estimation — Optimal Sensor/Controller Coordination with Random Two-way Delay”, 2020.
https://docs.lib.purdue.edu/ecetr/758/

P17. C.-H. Tsai and C.-C. Wang, “TR-ECE: Distribution-oblivious Online Algorithms for Age-of-Information Penalty Minimization”, 2022.
https://docs.lib.purdue.edu/ecetr/759/

1. A simple scheme that achieves optimal AAER under deadline constraints. The corresponding proof of its performance.

2. W.-C. Kuo and C.-C. Wang, “On the capacity of 2-user 1-hop relay erasure networks — the union of feedback, scheduling, opportunistic routing, and network coding.” (pdf containing detailed proofs)

3. C.-H. Chang and C.-C. Wang, “Coded Caching with Full Heterogeneity: Exact Capacity of The Two-User/Two-File Case.” (pdf containing detailed proofs)

Conference Proceedings and Presentations:

2024

86. W.J. Lee and C.-C. Wang, “AoI-optimal Scheduling for Arbitrary K-channel Update-Through-Queue Systems,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Athens, Greece, 2024, 6 pages. (final accepted version) (direct link) (slides).

2023

83. C.-C. Wang and D. Love, “Optimal Learning Rate of Sending One Bit Over Arbitrary Acyclic BISO-Channel Networks,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Taipei, Taiwan, June 25-30, 2023, 6 pages. (final accepted version) (direct link) (slides).

84. P.-W. Su, Y.-C. Huang, S.-C. Lin, I.-H. Wang, and C.-C. Wang, “Detailed Asymptotics of the Delay-Reliability Tradeoff of Random Linear Streaming Codes,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Taipei, Taiwan, June 25-30, 2023, 6 pages. (final accepted version) (direct link) (slides).

85. G. Yao, C.-C. Wang, and N.B. Shroff, “Age Minimization with Energy and Distortion Constraints,” in Proceedings of the 24th International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (ACM MobiHoc), Washington DC, USA, October 23-26, 2023. (final accepted version) (direct link) (slides).

2022

80. E. Ruzomberka, C.-C. Wang and D. Love, “Channel Capacity for Adversaries With Computationally Bounded Observations,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Espoo, Finland, June 26 – July 1, 2022, 6 pages. (final accepted version) (direct link) (slides).

81. P.-W. Su, Y.-C. Huang, S.-C. Lin, I.-H. Wang, and C.-C. Wang, “Sequentially Mixing Randomly Arriving Packets Improves Channel Dispersion Over Block-Based Designs,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Espoo, Finland, June 26 – July 1, 2022, 6 pages. (final accepted version) (direct link) (slides).

82. C.-C. Wang, “How Useful is Delayed Feedback in AoI Minimization - A Study on Systems With Queues in Both Forward and Backward Directions”, in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Espoo, Finland, June 26 – July 1, 2022, 6 pages. (final accepted version) (direct link) (slides).

2021

76. S.-C. Lin, C.-C. Wang, I.-H. Wang, Y.-C. Huang, Y.-C. Lai, “On finite-length analysis and channel dispersion for broadcast packet erasure channels with feedback,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Melbourne, Australia, July 12-20, 2021, virtual conference, 6 pages. (final accepted version) (direct link) (slides).

77. P.-W. Su, Y.-C. Huang, S.-C. Lin, I.-H. Wang, and C.-C. Wang, “Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Melbourne, Australia, July 12-20, 2021, virtual conference, 6 pages. (final accepted version) (direct link) (slides).

78. C.-H. Tsai and C.-C. Wang, “Jointly Minimizing AoI Penalty and Network Cost Among Coexisting Source-Destination Pairs,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Melbourne, Australia, July 12-20, 2021, virtual conference, 6 pages. (final accepted version) (direct link) (slides).

79. S.-C. Lin, Y.-C. Lai, Y.-C. Huang, C.-C. Wang, I.-H. Wang, “Optimal finite-length linear codes and the corresponding channel dispersion for broadcast packet erasure channels with feedback”, in Proceedings of the 2021 IEEE Information Theory Workshop (ITW), Kanazawa, Japan, October 17-21, 2021, virtual conference, 6 pages. (final accepted version) (direct link) (slides).

2020

71. C.-H. Chang, C.-C. Wang, and B. Peleato, “On Coded Caching for Two Users with Overlapping Demand Sets,” in Proceedings of the IEEE International Conference on Communications (ICC), Dublin, Ireland, June 7-11, 2020, virtual conference, 6 pages. (final accepted version) (direct link) (slides).

72. P.-W. Su, Y.-C. Huang, S.-C. Lin, I.-H. Wang, and C.-C. Wang, “Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Los Angeles, USA, June 21-26, 2020, virtual conference, 6 pages. (final accepted version) (direct link) (slides).

73. C.-H. Tsai and C.-C. Wang, “Age-of-Information Revisited: Two-way Delay and Distribution-oblivious Online Algorithm,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Los Angeles, USA, virtual conference, June 21-26, 2020, 6 pages. (final accepted version) (direct link) (slides).

74. C.-H. Tsai and C.-C. Wang, “Unifying AoI Minimization and Remote Estimation - Optimal Sensor/Controller Coordination with Random Two-way Delay,” in Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), Toronto, Canada, virtual conference, July 6-9, 2020, 10 pages. (final accepted version) (direct link) (slides).

75. D. Ogbe, C.-C. Wang, and D. J. Love, “Backhauling many devices: Relay schemes for massive random access networks,” in Proceedings of 2020 IEEE Global Communications Conference (GLOBECOM), Taipei, Taiwan, December 7-11, 2020, 6 pages. (final accepted version) (direct link) (slides).

2019

67. C.-H. Chang and C.-C. Wang, “Coded Caching with Full Heterogeneity: Exact Capacity of The Two-User/Two-File Case,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Paris, France, July 7 – 12, 2019, 5 pages. (final accepted version) (direct link) (slides).

68. C.-H. Chang and C.-C. Wang, “Coded Caching with Heterogeneous File Demand Sets - The Insufficiency of Selfish Coded Caching,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Paris France, July 7 – 12, 2019, 5 pages. (final accepted version) (direct link) (slides).

69. J. Zhang, X. Lin, and C.-C. Wang, “Closing the Gap for Coded Caching with Distinct File Sizes,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Paris France, July 7 – 12, 2019, 5 pages. (final accepted version) (direct link) (slides).

70. D. Ogbe, C.-C. Wang, D.J. Love, “On the Optimal Delay Amplification Factor of Multi-Hop Relay Channels,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Paris France, July 7 – 12, 2019, 5 pages. (final accepted version) (direct link) (slides).

2018

65. J. Zhang and C.-C. Wang, “On The Rate-Cost of Gaussian Linear Control Systems with Random Communication Delays,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Veil, Colorado, USA, June 17 – 22, 2018, 5 pages. (final accepted version) (accompanying proofs of Propositions 1 and 2) (direct link) (slides).

66. I. Ahmad and C.-C. Wang, “Flexible Fractional Repetition Codes for Distributed Storage Networks,” in Proceedings of 56th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, October 3-5, 2018, 8 pages. (final accepted version) (direct link) (slides).

2017

63. C.-H. Chang and C.-C. Wang, “A New Capacity-Approaching Protocol for General 1-to-K Broadcast Packet Erasure Channels with ACK/NACK,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Aachen, Germany, June 25 – 30, 2017, 5 pages. (final accepted version) (direct link) (slides).

64. C.-C. Wang, D.J. Love, and D. Ogbe, “Transcoding: A New Strategy for Relay Channels,” in Proceedings of 55th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, October 4-6, 2017, 5 pages. (final accepted version) (direct link) (slides).

2016

59. L. Deng, C.-C. Wang, M. Chen, and S. Zhao, “Timely Wireless Flows with Arbitrary Traffic Patterns: Capacity Region and Scheduling Algorithms,” in Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), San Francisco, USA, April 10 – 15, 2016, 9 pages. (final accepted version) (direct link) (slides).

60. C.-C. Wang, “Delay-Constrained Capacity For Broadcast Erasure Channels: A Linear-Coding-Based Study” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Barcelona, Spain, July 10 – 15, 2016, 5 pages. (final accepted version) (direct link) (slides).

61. J. Han and C.-C. Wang, “Linear Network Coding Capacity Region of The Smart Repeater with Broadcast Erasure Channels” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Barcelona, Spain, July 10 – 15, 2016, 5 pages. (final accepted version) (direct link) (slides).

62. M. Chen, Y. Tian, and C.-C. Wang, “On Coding Capacity of Delay-Constrained Network Information Flow: An Algebraic Approach” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Barcelona, Spain, July 10 – 15, 2016, 5 pages. (final accepted version) (direct link) (slides).

2015

56. I. Ahmad and C.-C. Wang, “When Locally Repairable Codes Meet Regenerating Codes – What If Some Helpers Are Unavailable” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Hong Kong, China, June 14 – 19, 2015, pp. 849-853. (final accepted version) (direct link) (slides).

57. J. Zhang, X. Lin, C.-C. Wang, and X. Wang, “Coded Caching For Files With Distinct File Sizes” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Hong Kong, China, June 14 – 19, 2015, pp. 1686-1690. (final accepted version) (direct link) (slides).

58. J. Han and C.-C. Wang, “General Capacity Region For The Fully-Connected 3-Node Packet Erasure Network” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Hong Kong, China, June 14 – 19, 2015, pp. 2648-2652. (final accepted version) (direct link) (slides).

2014

52. W.-C. Kuo and C.-C. Wang, “Robust and Optimal Opportunistic Scheduling for Downlink 2-Flow Inter-session Network Coding,” in Proceedings of the 33rd Conference on Computer Communications (INFOCOM), Toronto, Canada, April 27 – May 2, 2014, pp. 655-663. (final accepted version) (direct link) (slides).

53. C.-C. Wang and M. Chen, “Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Honolulu, Hawaii, USA, June 29 – July 4, 2014, pp. 866-870. (final accepted version) (direct link) (slides).

54. S. Kamath, D. Tse, and C.-C. Wang, “Two-unicast is hard,” in Proceedings of the IEEE Int'l Symp. Information Theory (ISIT), Honolulu, Hawaii, USA, June 29 – July 4, 2014, pp. 2147-2151. (final accepted version) (direct link) (slides).

55. I. Ahmad and C.-C. Wang, “When and By How Much Can Helper Node Selection Improve Regenerating Codes?”, in Proceedings of 52nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, October 1-3, 2014, pp. 459-466. (final accepted version) (direct link) (slides).

2013

49. X. Li, X. Tang, C.-C. Wang, and X. Lin, “Gibbs-sampling-based optimization for the deployment of small cells in 3G heterogeneous networks,” 2013 11^th Symposium on Modeling & Optimization in Mobile, Ad Hoc & Wireless Networks (WiOpt), May 13-17, 2013, pp. 444-451. (final accepted version) (direct link) (slides).

50. D. Shin, S. Bagchi, and C.-C. Wang, “Toward Optimal Sniffer-Channel Assignment for Reliable Monitoring in Multi-Channel Wireless Networks,” in Proceedings of the IEEE International Conference on Sensing, Communication, and Networking (SECON), Singapore, June 30-July 3, 2013, pp. 203-211. (final accepted version) (direct link) (slides).

51. C.-C. Wang, “Linear Network Coding Capacity for Broadcast Erasure Channels With Feedback, Receiver Coordination, and Arbitrary Security Requirement”, in Proceedings of 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey. July 7 – 12, 2013, pp. 2900-2904. (final accepted version) (direct link) (slides).

2012

44. D. Shin, C.-C. Wang, and S. Bagchi, “Distributed Online Channel Assignment Toward Optimal Monitoring in Multi-Channel Wireless Networks,” in Proceedings of the 31st Conference on Computer Communications (INFOCOM), mini conference, Orlando, USA, March 26, 2012, pp. 2626-2630. (final accepted version) (direct link) (slides).

45. G. B. Kyung and C.-C. Wang, “On The Error-Prone Substructures for The Binary-Input Ternary-Output Channel and Its Corresponding Exhaustive Search Algorithm,” in Proceedings of the 2012 IEEE International Conference on Communications (ICC), Ottawa, Canada, June 10-15, 2012, pp. 2233-2237. (final accepted version) (direct link) (slides).

46. R. Gandhi, C.-C. Wang, and Y.C. Hu, “Fast Rendezvous for Multiple Clients for Cognitive Radios Using Coordinated Channel Hopping,” in Proceedings of The 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2012, Seoul, Korea, June 18 – 21, 2012, pp. 434-442. (final accepted version) (direct link) (slides).

47. C.-C. Wang and D. J. Love, “Linear Network Coding Capacity Region of 2-Receiver MIMO Broadcast Packet Erasure Channels with Feedback,” in Proceedings of 2012 IEEE International Symposium on Information Theory, Boston, USA. July 1 – 6, 2012, pp. 2062-2066. (final accepted version) (direct link) (slides).

48. C.-C. Wang, “Capacity Region of Two Symmetric Nearby Erasure Channels With Channel State Feedback,” in Proceedings of 2012 IEEE Information Theory Workshop, Lausanne, Switzerland. September 3—7, 2012, pp. 352-356. (final accepted version) (direct link) (slides).

2011

36. P.-K. Huang, C.-C. Wang, and X. Lin, “A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay,” in Proceedings of the 30th Conference on Computer Communications (INFOCOM), Shanhai, China, April 10 – 15, 2011, pp. 2588-2596. (final accepted version) (direct link) (slides).

37. D. Koutsonikolas, Y.C. Hu, C.-C. Wang, M. Comer, and A. Mohamed, “Efficient Online WiFi Delivery of Layered-Coding Media using Inter-layer Network Coding,” in Proceedings of the 31st Int'l Conference on Distributed Computing Systems (ICDCS 2011), Minneapolis, Minnesota, USA, June 20 – 24, 2011, pp. 237-247. (final accepted version) (direct link) (slides).

38. R. Gandhi, M. Yang, D. Koutsonikolas, Y.C. Hu, M. Comer, A. Mohamed, and C.-C. Wang, “The Impact of Inter-layer Network Coding on the Relative Performance of MRC/MDC WiFi Media Delivery,” in Proceedings of The 21st International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2011), Vancouver, British Columbia, Canada. June 1 – 3, 2011, pp. 27-32. (final accepted version) (direct link) (slides).

39. W.-C. Kuo and C.-C. Wang, “On The Capacity Of 2-User 1-Hop Relay Erasure Networks — The Union of Feedback, Scheduling, Opportunistic Routing, and Network Coding,” in Proceedings of 2011 IEEE International Symposium on Information Theory, Saint Petersburg, Russia. July 31 – August 5, 2011, pp. 1337-1341. (final accepted version) (direct link) (slides).

40. C.-C. Wang and J. Han, “Common Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel,” in Proceedings of 2011 IEEE International Symposium on Information Theory, Saint Petersburg, Russia. July 31 – August 5, 2011, pp. 1708-1712. (final accepted version) (direct link) (slides).

41. X. Li, C.-C. Wang, and X. Lin, “Optimal Immediately-Decodable Inter-session Network Coding (IDNC) Schemes for Two Unicast Sessions with Hard Deadline Constraints,” in Proceedings of 49th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, September 28-30, 2011, pp. 784-791. (final accepted version) (direct link) (slides).

42. J. Han, N.B. Shroff and C.-C. Wang, “Analysis of Precoding-based Intersession Network Coding and The Corresponding 3-Unicast Interference Alignment Scheme,” in Proceedings of 49th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, September 28-30, 2011, pp. 1033-1040. (final accepted version) (direct link) (slides).

43. D. Koutsonikolas, C.-C. Wang, Y.-C. Hu, and N.B. Shroff, “FEC-Based AP Downlink Transmission Schemes For Multiple Flows: Combining The Reliability and Throughput Enhancement of Intra- and Inter-flow Coding”, presented in the 29th International Symposium on Computer Performance, Modeling, Measurements and Evaluation, Amsterdam, Netherlands, October 18-20, 2011, pp. 1118-1135. (final accepted version) (direct link) (slides).

2010

31. D. Koutsonikolas, C.-C. Wang, and Y.C. Hu, “CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments,” in Proceedings of the 29th Conference on Computer Communications (INFOCOM), San Diego, USA, March 15 – 19, 2010, pp. 1 – 9. (pdf) (direct link) (slides).

32. X. Li, C.-C. Wang, and X. Lin, “Throughput and Delay Analysis on Uncoded and Coded Wireless Broadcast with Hard Deadline Constraints,” in Proceedings of the 29th Conference on Computer Communications (INFOCOM), mini conference, San Diego, USA, March 15 – 19, 2010, pp. 1 – 5. (pdf) (direct link) (slides).

33. C.-C. Wang, “On the Capacity of Wireless 1-Hop Intersession Network Coding — A Broadcast Packet Erasure Channel Approach,” in Proceedings of 2010 IEEE International Symposium on Information Theory, Austin, Texas, USA, June 13 – 18, 2010, pp. 1893 – 1897. (pdf) (direct link) (slides).

34. G.B. Kyung and C.-C. Wang, “Exhaustive Search for Small Fully Absorbing Sets and The Corresponding Low Error-Floor Decoder,” in Proceedings of 2010 IEEE International Symposium on Information Theory, Austin, Texas, USA, June 13 – 18, 2010, pp. 739 – 743. (pdf) (direct link) (slides).

35. C.-C. Wang, “Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback,” in Proceedings of 48th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, September 29 – October 1, 2010, pp. 1347-1354. (pdf) (direct link) (slides).

2009

23. G.B. Kyung and C.-C. Wang, “On the Designs and Challenges of Practical Binary Dirty Paper Coding,” in Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), Budapest, Hungary, April 5 – 8, 2009, pp. 1 – 6. (pdf) (direct link) (slides).

24. C.-C. Wang and X. Lin, “Fast Resource Allocation for Network-Coded Traffic - A Coded-Feedback Approach,” in Proceedings of the 28th Conference on Computer Communications (INFOCOM), mini conference, Rio de Janeiro, Brazil, April 19 – 25, 2009, pp. 2801 – 2805. (pdf) (direct link) (slides).

25. D. Koutsonikolas, Y. C. Hu, C.-C. Wang, “An Empirical Study of Performance Benefits of Network Coding in Multihop Wireless Networks,” in Proceedings of the 28th Conference on Computer Communications (INFOCOM), mini conference, Rio de Janeiro, Brazil, April 19 – 25, 2009, pp. 2981 – 2985. (pdf) (direct link) (slides).

26. D. Koutsonikolas, Y. C. Hu, C.-C. Wang, “Pacifier: High-Throughput, Reliable Multicast without ``Crying Babies'' in Wireless Mesh Networks,” in Proceedings of the 28th Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil, April 19 – 25, 2009, pp. 2473 – 2481. (pdf) (direct link) (slides).

27. S.H. Sellke, C.-C. Wang, S. Bagchi, N.B. Shroff, “Covert TCP/IP Timing Channels: Theory to Implementation,” in Proceedings of the 28th Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil, April 19 – 25, 2009, pp. 2204 – 2212. (pdf) (direct link) (slides).

28. D. Koutsonikolas, C.-C. Wang, and Y.C. Hu, “Designing Coded Feedback for Efficient Network Coding Based Opportunistic Routing,” ACM MobiCom 2009, 1st place in ACM Student Research Competition (SRC), September 20-25, 2009. (pdf) (direct link) (slides).

29. C.-C. Wang and N.B. Shroff, “Random Linear Intersession Network Coding With Selective Canceling,” in Proceedings of 2009 IEEE Information Theory Workshop, Taormina, Sicily, Italy, October 11-16, 2009, pp. 559 – 563. (pdf) (direct link) (slides).

30. C-C. Wang, N.B. Shroff, and A. Khreishah, “On Cross-Layer Optimizations for Intersession Network Coding on Practical 2-Hop Relay Networks,” in Proceedings of the 43^rd Asilomar Conference on Signals, Systems and Computers, Pacific Grove, California, USA, November 1-4, 2009. Copyright 2001 SS&C, pp. 771 – 775. (pdf) (direct link) (slides).

2008

18. C.-C. Wang, N.B. Shroff, “On Wireless Network Scheduling with Intersession Network Coding,” in Proceedings of the 42nd Conference on Information Sciences and Systems, Princeton, USA, March 19 - 21, 2008, pp. 30 – 35. (pdf) (direct link) (slides).

19. A. Khreishah, C.-C. Wang, N.B. Shroff, “Optimization Based Rate Control for Communication Networks with Inter-session Network Coding,” in Proceedings of the 27th Conference on Computer Communications (INFOCOM 2008), Phoenix, Arizona, USA, April 15-17, 2008, pp. 81-85. (pdf) (direct link) (slides).

20. C.-C. Wang, “Pruning Network Coding Traffic By Network Coding — A New Max-Flow Algorithm,” in Proceedings of 2008 IEEE International Symposium on Information Theory. Toronto, Canada, July 6 – 11, 2008, pp. 26 - 30. (pdf) (direct link) (slides).

21. D. Koutsonikolas, Y. C. Hu, C.-C. Wang, “XCOR: Synergistic Interflow Network Coding and Opportunistic Routing,” poster, in ACM International Conference on Mobile Computing and Networking (MobiCom 2008), San Francisco, CA, September 14-19, 2008. (pdf) (direct link) (slides) (3rd place in ACM Student Research Competition (SRC), Mobicom 2008)

22. C.-C. Wang, “A Coded-Feedback Construction of Locally Minimum-Cost Multicast Network Codes,” in Proceedings of 46th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, September 23-26, 2008, pp. 146-153. (pdf) (direct link) (slides).

2007

11. C.-C. Wang, “On the Exhaustion and Elimination of Trapping Sets: Algorithms & The Suppressing Effect,” in Proceedings of 2007 IEEE International Symposium on Information Theory, Nice, France, June 24 - 29, 2007, pp. 2271 - 2275. (pdf) (direct link) (slides).

12. D. Guo, C.-C. Wang “Random Sparse Linear Systems Observed Via Arbitrary Channels: A Decoupling Principle,” in Proceedings of 2007 IEEE International Symposium on Information Theory, Nice, France, June 24 - 29, 2007, pp. 946 - 950. (pdf) (direct link) (slides).

13. C.-C. Wang, N.B. Shroff, “Beyond the Butterfly — A Graph-Theoretic Characterization of the Feasibility of Network Coding with Two Simple Unicast Sessions,” in Proceedings of 2007 IEEE International Symposium on Information Theory, Nice, France, June 24 - 29, 2007, pp. 121 - 125. (pdf) (direct link) (slides).

14. S.H. Sellke, C.-C. Wang, N.B. Shroff, S. Bagchi, “Capacity Bounds on Timing Channels with Bounded Service Times,” in Proceedings of 2007 IEEE International Symposium on Information Theory, Nice, France, June 24 - 29, 2007, pp. 981 - 985. (pdf) (direct link) (slides).

15. C.-C. Wang, A. Khreishah, N.B. Shroff, “On Characterizing the Throughput Degradation for Network Coding with Two Sessions,” presented in 2nd Mathematical Programming Society International Conference on Continuous Optimization, Hamilton, ON, Canada, August 13 – 16, 2007. (abstract) (direct link) (slides).

16. C.-C. Wang, N.B. Shroff, “Intersession Network Coding for Two Simple Multicast Sessions,” in 45-th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, September 26 – 28, 2007, pp. 682 – 689. (pdf) (direct link) (slides).

17. A. Khreishah, C.-C. Wang, N.B. Shroff, “Capacity Regions for Multiple Unicast Flows using Inter-session Network Coding,” in Proceedings of the 3rd Annual International Wireless Internet Conference (WICON), Austin, Texas, USA, October 22-24, 2007, 10 pages. (pdf) (direct link) (slides).

2006

6. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “Upper bounding the performance of arbitrary finite LDPC codes on binary erasure channels,” in Proceedings of 2006 IEEE International Symposium on Information Theory. Seattle, USA, July 9 – 14, 2006, pp. 411 - 415. (pdf) (direct link) (slides).

7. C.-C. Wang, D. Guo, “Belief propagation is asymptotically equivalent to MAP detection for sparse linear systems” in Proceedings of the 44-th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, September 27 – 29, 2006, pp. 926 – 935 (pdf) (direct link) (slides).

8. S. Sellke, N.B. Shroff, S. Bagchi, C.-C. Wang, “Timing Channel Capacity for Uniform and Gaussian Servers” in Proceedings of the 44-th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, September 27 – 29, 2006, pp. 1485 - 1486 (pdf) (direct link) (slides).

9. C.-C. Wang, “Code annealing and the suppressing effect of the cyclically lifted LDPC code ensemble,” in Proceedings of 2006 IEEE Information Theory Workshop, Chengdu, China, October 22-26, pp. 86 - 90. (pdf) (direct link) (slides).

10. D. Guo, C.-C. Wang, “Asymptotic mean-square optimality of belief propagation for sparse linear systems,” in Proceedings of 2006 IEEE Information Theory Workshop, Chengdu, China, October 22-26, pp. 194 – 198. (pdf) (direct link) (slides).

2005

5. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “On the typicality of the linear code among the LDPC coset code ensemble,” in Proceedings of the 39th Conference on Information Sciences and Systems, Baltimore, USA, March 16 - 18, 2005, 6 pages. (pdf) (direct link) (slides).

2004

4. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “On finite-dimensional bounds for LDPC-like codes with iterative decoding,” in Proceedings of the International Symposium on Information Theory and its Applications, Parma, Italy, October, 10 - 13, 2004, 6 pages. (pdf) (direct link) (slides).

2003

2. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “Density evolution for asymmetric memoryless channels,” in Proceedings of the 3rd International Symposium on Turbo Codes & Related Topics, Brest, France, September 1 - 5, 2003, pp. 121 - 124. (pdf) (direct link) (slides).

3. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “Bandit problems with arbitrary side observations,” in Proceedings of the 42nd IEEE Conference on Decision and Control, Maui, USA, December 9 - 12, 2003, pp. 2948 -2953. (pdf) (direct link) (slides).

2002

1. C.-C. Wang, S.R. Kulkarni, H.V. Poor, “Bandit problems with side observations,” in Proceedings of the 41st IEEE Conference on Decision and Control, Las Vegas, USA, December 10 - 13, 2002, pp. 3988 - 3993. (pdf) (direct link) (slides).

Pending Journal Publications: (pdf available upon email request)

Invited Lectures and Short-term Visits:

1. April 8, 2005, “Low-density parity-check codes for symmetric and non-symmetric channels,” Northwestern University, Evanston, Illinois, USA. (slides)

2. July 6, 2008, “Recent graph-theoretic progress of network coding - from characterization theorems to new graph algorithms,” Workshop on Information Theory and Wireless Communications, McMaster University, Hamilton, Ontario, Canada. (slides)

3. February 11, 2010, “On the Capacity of Practical Wireless 2-Hop Relay Networks with Intersession Network Coding,” Department of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA. (slides)

4. March 12, 2010, “Bringing Structures Back to Random Linear Network Coding (NC) - From Capacity Results of Wireless 1-Hop Intersession NC to Practical Network Coding Protocols,” Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, USA. (slides).

5. May 31, 2010, “Capacity-Achieving Network Code Design For Wireless 1-Hop Networks,” Department of Electrical Engineering, National Tsin-Hua University, Hsin-Chu, Taiwan.

6. June 3, 2010, “Capacity Analysis of Wireless 1-Hop Networks with Message Side Information and with Channel Output Feedback,” Department of Communication Engineering, National Chiao-Tung University, Hsin-Chu, Taiwan.

7. June 4, 2010, “Quantifying and Achieving the Capacity of Wireless 1-Hop Network Coding --- A Code-Alignment-Based Approach,” Institute of Network Coding, Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong.

8. August 13, 2010, “Quantifying and Achieving the Capacity of Wireless 1-Hop Network Coding --- A Code-Alignment-Based Approach: Part I: XOR in The Air, Part II: The Capacity of Packet Erasure Channel with Channel Output Feedback,” Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, USA.

9. Novermber 12, 2010, “Quantifying and Achieving the Capacity of Wireless 1-Hop Network Coding --- A Code-Alignment-Based Approach,” Department of Electrical Engineering, University of South California, Los Angeles, USA.

10. April 27-28, 2011, “Capacity of Wireless 1-Hop Relay Networks — From Message Side Information to Joint Scheduling and Network Coding with Delayed Channel Status Feedback,” Department of Electrical and Computer Engineering, The Ohio State University, Columbus, Ohio, USA.

11. May 23 – June 3, 2011, Short-term scholar visit to Intel-NTU Connected Context Computing Center, Taipei, Taiwan.

12. May 23, 2011, “Exotic Routing Protocols for Wireless Mesh Networks,” Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan.

13. May 26, 2011, “Capacity of Wireless 1-Hop Relay Networks — From Message Side Information to Joint Scheduling and Network Coding with Delayed Channel Status Feedback,” Research Center for Information Technology Innovation, Academia Sinica, New Taipei City, Taiwan.

14. May 30, 2011, “Regulating Network Coded Traffic by Network Coded Feedback - An Online Opportunistic Routing Protocol For Wireless Mesh Networks,” Department of Electrical Engineering, National Tsing-Hua University, Hsin-Chu, Taiwan.

15. August 29, 2011, “Capacity of Wireless 1-Hop Relay Networks — From Message Side Information to Joint Scheduling and Network Coding with Delayed Channel Status Feedback,” Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, USA.

16. June 9-10, 2012, A short course titled “Introduction of Network Coding - From fundamental principles to protocol design to open challenges,” National Chiao-Tung University, Hsin-Chu, Taiwan.

17. August 21, 2013, “Multi-Unicast Capacity of Packet-Level Network Coding on Small Wireless Networks,” Institute of Network Coding, Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong.

18. November 8, 2013, “Multi-Unicast Capacity of Packet-Level Network Coding on Small Wireless Networks,” University of Hong Kong.

19. November 25, 2013, “Multi-Unicast Capacity of Packet-Level Network Coding on Small Wireless Networks,” Intel-NTU Connected Context Computing Center, Taipei, Taiwan.

20. April 29, 2014, “Multi-Unicast Capacity of Packet-Level Network Coding on Small Wireless Networks,” University of Tornoto, Canada.

21. August 13, 2014, “Toward Practical Implementation of Throughput-Optimal Network Codes - Issues and New Theoretic Development,” Research Center for Information Technology Innovation, Academia Sinica, New Taipei City, Taiwan.

22. October 13, 2014, “Toward Practical Implementation of Throughput-Optimal Network Codes - Issues and New Theoretic Development,” University of Tennessee, Knoxville, TN, USA.

23. November 28, 2018, “Transcoding – A New Strategy for Relay Channels,” Auburn University, Auburn, AL, USA.

24. December 03, 2018, “Transcoding – A New Strategy for Relay Channels,” Northwestern University, EECS, Evanston, IL, USA.