Research

BATS Code for Network Transmission

Introduction

Data loss during transmission is inevitable in many communication scenarios. As a network coding technology, BATS code is developed to improve the network transmission rate of networks with packet loss. BATS code was invented by Shenghao Yang and Raymond W. Yeung.

In contrast to traditional store-and-forward, BATS code allows intermediate network nodes apply simple network coding so that new packets can be generated along the way, which not only help to compensate the network loss, but also improve the throughput for multicast. BATS code outperforms traditional techniques use retransmission or fountain codes, and can asymptotical achieve the theoretical limit.

A wireless multi-hop network transmission protocol has been built using BATS code. It enables efficient communications through tens of wireless hops with dynamic link loss patterns. A video streaming demonstration using BATS code has been carried out successfully.

Demo 

Video steaming comparsion of BATS and fountain codes in a two-hop network (settings)

1. Fountain code

Youku video: http://v.youku.com/v_show/id_XMTMyMDU1MDY1Ng==.html

2. BATS code

Youku video: http://v.youku.com/v_show/id_XMTMyMDU0OTE1Mg==.html

Projects

  • New BATS code wireless network protocols
  • BATS code application for space and satellite communications
  • Mobile device implementation of BATS code protocols
 
Resources
 
Papers
 
Simbats

A C/C++ implementation of BATS codes for simulation of the performance.
Github https://github.com/shhyang/simbats

Patent

 
MISCs

A poster in a Qualcomm seminar
A set of slides for a INC-SZ seminar

Distributed Data Storage using NC

Introduction

Modern storage systems store massive amounts of data over a set of storage nodes. To achieve data reliability, redundancy is introduced to the data. In addition, in order to maintain the required redundancy, the storage system must support data repair. A critical issue is how to achieve timely repair process, so as to minimize the chance of data unreliability when more nodes fail. Recent work has shown that regenerating codes, which are based on the concept of network coding, can improve the data repair performance when some storage nodes are failed, as compared to traditional storage schemes such as erasure coding. However, there remain open issues regarding the feasibility of deploying regenerating codes in practice.

This project, led by Prof. Patrick Lee (http://www.cse.cuhk.edu.hk/~pclee), focuses on studying the practicality of network coding data storage. The main objectives of this project are:

– To realize network coding data storage in practical implementation.

– To conduct extensive experimental studies and evaluate the performance in a real storage environment.

– To provide insights into deploying network coding data storage in practice

Building on this success, INC held the First Workshop on Network Coding and Data Storage at CUHK (NCDS 2011) on July 21-22, 2011. The purpose of this workshop is to bring together researchers in information theory, data storage, and distributed systems to explore the potential of NC applications in distributed storage systems.

 

Projects

1.NCCloud

NCCloud is a proof-of-concept prototype of a network-coding-based file system that aims at providing fault tolerance and reducing data repair cost when storing files using multiple-cloud storage (or any other kinds of raw storage devices). NCCloud is a proxy-based file system that interconnects multiple (cloud) storage nodes. It can be mounted as a directory on Linux, and file uploading/downloading are done by copying files to/from the mounted directory. NCCloud is built on FUSE, an open-source, programmable user-space file system that provides application programmable interfaces (APIs) for file system operations. From the point of view of user applications, NCCloud presents a file system layer that transparently stripes data across storage nodes.

Network codes for storage repair require that storage nodes encode the stored data during the repair process. However, this may not be feasible for some storage systems where nodes only provide the basic I/O functionalities but do not have the encoding capability. Our work is to adapt the benefits of network codes in the storage repair of a practical storage setting, by relaxing the encoding requirement of storage nodes.

NCCloud supports a variety of coding schemes, in particular the Functional Minimum Storage Regenerating (F-MSR) codes. Compared to traditional optimal erasure codes (e.g., Reed-Solomon), FMSR codes maintains the same storage overhead under the same data redundancy level, but uses less repair traffic during the recovery of a single failed storage node. NCCloud realizes regenerating codes in a practical cloud storage system that does not require any encoding/decoding intelligence on the cloud storage nodes.

Publications

Yuchong Hu, Patrick P. C. Lee, Kenneth W. Shum
“Analysis and Construction of Functional Regenerating Codes with Uncoded Repair for Distributed Storage Systems.”
CoRR abs/1208.2787, August 2012.

Yuchong Hu, Henry C. H. Chen, Patrick P. C. Lee, and Yang Tang
“NCCloud: Applying Network Coding for the Storage Repair in a Cloud-of-Clouds”
Proceedings of the 10th USENIX Conference on File and Storage Technologies (FAST ’12), San Jose, CA, February 2012.
pdf | talk | poster | source code

Source
http://ansrlab.cse.cuhk.edu.hk/software/nccloud/

 

2.FMSR-DIP

FMSR-DIP is a proof-of-concept prototype aimed at providing data integrity protection atop today’s cloud storage. Regenerating code is a recently proposed erasure code that requires less data to be downloaded when repairing node failures, compared to conventional codes such as the Reed-Solomon codes. Functional minimum storage regenerating (FMSR) code is a type of regenerating code that is also maximum distance separable. FMSR-DIP augments the FMSR code with a data checking capability that allows stored data to be sampled for checking in a flexible manner, without adding to its download traffic requirements during file downloads or repairs. In short, our work adds an efficient data integrity checking capability to FMSR code to provide a more comprehensive data protection solution, without eliminating the advantage of using FMSR code.

Publications

Henry C. H. Chen and Patrick P. C. Lee
“Enabling Data Integrity Protection in Regenerating-Coding-Based Cloud Storage”
Proceedings of the 31st International Symposium on Reliable Distributed Systems (SRDS 2012), Irvine, CA, October 2012. 
Tech Report pdf | pdf | talk | source code

Source
http://ansrlab.cse.cuhk.edu.hk/software/fmsrdip/

 

3.NCFS

NCFS is a proof-of-concept prototype of a Network-Coding-based Distributed File System. NCFS is a proxy-based file system that interconnects multiple storage nodes. It relays regular read/write operations between user applications and storage nodes, and relays data among storage nodes during the data repair process. NCFS is built on FUSE, an open-source, programmable user-space file system that provides application programmable interfaces (APIs) for file system operations. From the point of view of user applications, NCFS presents a file system layer that transparently stripes data across physical storage nodes.

NCFS supports a specific regenerating coding scheme called Exact Minimum Bandwidth Regenerating (E-MBR) codes [Rashmi et al.; 2009], which seek to minimize repair bandwidth. One key property of E-MBR is that it does not require any encoding/decoding intelligence on the storage nodes, as long as the storage nodes provide the standard I/O interfaces. NCFS also supports RAID-based erasure coding schemes, so as to enable us to conduct a comprehensive empirical study of different classes of data recovery for distributed storage under real network settings. To the best of our knowledge, NCFS is the first work that realizes regenerating codes in a practical distributed storage system.

Publications

Yuchong Hu, Chiu-Man Yu, Yan Kit Li, Patrick P. C. Lee, and John C. S. Lui
“NCFS: On the Practicality and Extensibility of a Network-Coding-Based Distributed File System”
Proceedings of the 2011 International Symposium on Network Coding (NETCOD), Beijing, China, July 2011. 
pdf | talk | source code

Source
http://ansrlab.cse.cuhk.edu.hk/software/ncfs/

 

Ongoing Work

NCVFS

With the proliferation of video data and hence demand for data storage in general, it is critical to provide a fault-tolerant and secure cloud storage solution for storing a massive amount of video files. We propose the network-coding-based video file system (NCVFS), a distributed storage system which leverages on the concept of network coding, to provide scalable fault-tolerant data storage. NCVFS not only achieves the same level of reliability as traditional RAID-like systems, but also minimizes the repair bandwidth during data recovery. The latter implies a significant improvement on the overall system reliability. Aiming to support Internet streaming of video contents, NCVFS is developed as a platform with the broadcasting industry in mind. The underlying technologies are applicable to other (non-video) file types. Thus, we expect that NCVFS can also find applications in other areas/industries, and hence fuel the data storage industry as a whole.

 

Grants

The following grants are obtained based on this project.

“Distributed Archival Storage Systems using Non-Systematic Codes: Theory and Practice.” RGC Early Career Scheme (ECS), 01/2013 – 12/2015. Amount: HKD 550,000.

“Network Coding Distributed Storage of Video Files.” Innovation and Technology Fund (ITF), 07/2012 – 12/2013. Amount: HKD 994,750.

Network Coding Enabled Delay-Sensitive Multi-Party Video Conferencing

We have two works to revisit the problem of multi-party conferencing and rethink the design space beyond those explored in existing solutions which led by Prof. Minghua Chen.

Projects 

1. Celerity: A Low Delay Multiparty Conferencing Solution

We present “Celerity: A Low Delay Multiparty Conferencing Solution” [1,2], a multi-party conferencing solution specifically designed to maximizing session rate, while being subjected to a tight end-to-end delay constraints between any two parties which makes the problem uniquely challenging. It is entirely Peer-to-Peer (P2P), and as such eliminating the cost of maintaining centrally administered servers. It is designed to deliver video with low end-to-end delays, at quality levels commensurate with available network resources over arbitrary network topologies where bottlenecks can be anywhere in the network. This is in contrast to commonly assumed P2P scenarios where bandwidth bottlenecks reside only at the edge of the network. 

The highlight in our design is a distributed and adaptive rate control protocol, that can discover and adapt to arbitrary topologies and network conditions quickly, converging to efficient link rate allocations allowed by the underlying network. In accordance with adaptive link rate control, source video encoding rates are also dynamically controlled to optimize video quality in arbitrary and unpredictable network conditions. We apply network coding to allow flexible and opportunistic local loss recovery, without incurring additional retransmission delay which deteriorates conferencing experience. We have implemented Celerity in a prototype system, and demonstrate its superior performance over existing industrial and academic solutions, including Skype, in a local experimental testbed and over the Internet.

2. Cost-Effective Low-Delay Cloud Video Conferencing


As cloud computing paradigm has been advocated in recent video conferencing system design, we present our second work “Cost-Effective Low-Delay Cloud Video Conferencing” [3] to exploit the rich on-demand resources of a distributed cloud for better conferencing experience. A typical architectural design in cloud environment is to create video conferencing agents, i.e., virtual machines, in each cloud site, assign users to the agents, and enable inter-user communication through the agents. Given the diversity of devices and network connectivities of the users, the agents may also transcode the conferencing streams to the best formats and bitrates. In this architecture, two key issues exist on how to effectively assign users to agents and how to identify the best agent to perform a transcoding task, which are nontrivial due to the following: (1) the existing proximity-based assignment may not be optimal in terms of inter-user delay, which fails to consider the whereabouts of the other users in a conferencing session; (2) the agents may have heterogeneous bandwidth and processing availability, such that the best transcoding agents should be carefully identified, for cost minimization while best serving all the users requiring the transcoded streams.

To address these challenges, we formulate the user-to-agent assignment and transcoding-agent selection problems as an optimization problem, which targets at minimizing the operational cost of the conferencing provider while keeping the conferencing delay low. Using the recently-proposed Markov approximation framework of tackling combinatorial problems, we design a decentralized algorithm that provably converges to a bounded neighborhood of the optimal solution and adapts to system dynamics. An agent ranking scheme is also proposed to properly initialize our algorithm so as to improve its convergence. We implement a prototype video conferencing system realizing our algorithms, and carry out extensive evaluations using real-world traces. In a set of Internet-scale scenarios, our design reduces the operational cost by 77% as compared to a commonly-adopted alternative, while simultaneously yielding lower conferencing delays. Applying network coding to allow loss recovery is one of our future works.

Publications

[1] Xiangwen Chen, Minghua Chen, Baochun Li, Yao Zhao, Yunnan Wu, and Jin Li.
“Celerity: a low-delay multi-party conferencing solution.”
Proceedings of the 19th ACM international conference on Multimedia, pp. 493-502, 2011 [PDF] [Technical Report]

[2] Xiangwen Chen, Minghua Chen, Baochun Li, Yao Zhao, Yunnan Wu, and Jin Li.
“Celerity: A Low-Delay Multi-Party Conferencing Solution.”
IEEE Journal on Selected Areas in Communications, vol.31, no.9, pp.155,164, September 2013 [PDF]

[3] Mohammad H. Hajiesmaili, Lok To Mak, Zhi Wang, Chuan Wu, Minghua Chen, and Ahmad Khonsari.
“Cost-Effective Low-Delay Cloud Video Conferencing.”
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015 [PDF]


Physical-layer Network Coding (PNC)

Physical-layer Network Coding (PNC) was invented by Co-I Prof. Soung Chang Liew and his students in 2006. It is about applying the principle of NC by allowing EM waves to add up physically in a wireless broadcast situation. PNC has become an important subfield of NC. It is catching much attention in the research community, and there have been a few special issues on PNC organized by various academic journals.

In March 2011, our team successfully built a software radio prototype that demonstrates for the first time the principle of PNC. This prototype implements PNC in the frequency domain using the OFDM technology. As a result of this first investigation, a number of technical issues unique to PNC were uncovered and this added much energy to the ongoing theoretical research in the team.

In the second half of 2012, the team completed the first real-time prototype that allows file exchange between two nodes via a PNC relay in real-time (http://wireless.ie.cuhk.edu.hk/rpnc.html). A MAC protocol has been implemented to coordinate the simultaneous transmissions of the two nodes. Ongoing efforts focus on improving the efficiency, throughput, and reliability of the real-time system. Our demo video can be found in (https://www.youtube.com/watch?v=HmRBm_IIBQQ) and (https://www.youtube.com/watch?v=lOjMhjYCtFY).

In the first quarter of 2013, the team successfully demonstrated a first wireless local area network (WLAN) system that jointly exploits physical-layer network coding (PNC) and multiuser decoding (MUD), called network-coded multiple access (NCMA), to boost system throughput. Prior studies on PNC mostly focused on relay networks – generally network coding could play a major role only in relay networks (wired or wireless) in which network coding is performed by the relays. This is the first realized multiple access scheme that establishes the usefulness of PNC in a non-relay setting. In the last quarter of 2014, a real-time NCMA system that can outperform conventional WLAN by 100% in terms of throughput was built.

Building on our success in establishing the soft radio expertise, we organized several software radio implementation workshops: SRIF 2012 held at CUHK on Jan 12-13, 2012 (http://srif2012.inc.cuhk.edu.hk/); SRIF 2013 as an ACM SIGCOMM Workshop in Aug 2013 (http://conferences.sigcomm.org/sigcomm/2013/srif.php); and SRIF 2014 (http://conferences.sigcomm.org/sigcomm/2014/srif.php) held in conjunction with ACM SIGCOMM again in Chicago.

We are collaborating with DLR (German Aerospace Center) to explore the applications of PNC and NCMA in satellite networks. This is a long-term initiative that will straddle across a number of years. To kick-start the collaboration, in March 2014, we co-hosted a workshop (https://www2.inc.cuhk.edu.hk/sino-german/) in Shenzhen, sponsored by the Sino-German Research Grant.

2012
  1. L. Lu and S. C. Liew, “Asynchronous Physical-layer Network Coding,” IEEE Trans. on Wireless Communications, vol. 11, no. 2, pp. 819-831, Feb 2012. [Abstract]
  2. F. E. K. Au, J. B. Anderson and Wai Ho Mow, “Minimum distance analysis of multiheadmultitrack recording channels,” IEEE Transactions on Information Theory, vol. 58, no. 2, pp.878-887, Feb 2012. [Abstract]
  3. L. Lu, T. Wang, S. C. Liew, and S. Zhang, “Implementation of Physical-layer Network Coding,” Elsevier Phycom, Special Issue on “Network Coding and Its Applications to Wireless Communications,” Mar 2012. [Abstract]
  4. Y. Wu, K. W. Shum, L. Shen, and W. S. Wong, “Protocol sequence based channel access control algorithm in vehicular ad hoc networks”(in Chinese), Acta Electronica Sinica, vol. 40, no. 4, pp.826-831, Apr 2012. [Abstract]
  5. S. C. Liew, S. Zhang, and L. Lu, “Physical-layer Network Coding: Tutorial, Survey, and Beyond,” Elsevier Phycom, Special Issue of Physical Communication on “Network Coding and Its Applications to Wireless Communications”,a 39-page double-column tutorial paper surveying the research landscape of physical-layer network coding, May 2012. [Abstract]
  6. T. Liang, X. Fan, Q. Li, and S.-Y. R. Li, “Detection of short dispersed tandem repeats by reversible jump Markov chain Monte Carlo,” Nucleic Acids Research, Oxford Journals, doi: 10.1093/nar/gks644, pp. 1-8, June 2012. [Abstract]
  7. M. Chen, M. Ponec, S. Sengupta, J. Li, and P. A. Chou, “Utility Maximization in Peer-to-Peer Systems with Applications to Video Conferencing,” IEEE/ACM Trans. on Networking, June 2012. [Abstract]
  8. X. Li, P. Fan, and K. W. Shum, “Construction of space/wavelength/time spread optical code with large family size,” IEEE Comm. Letter, vol. 16, no. 6, pp.893-896, June 2012. [Abstract]
  9. Der-Feng Tseng, Yunghsiang Sam Han, Wai Ho Mow, Li-Chung Chang, and A. J. Han Vinck, “Robust Clipping for OFDM Transmissions over Memoryless Impulsive Noise Channels,” IEEE Communications Letters, vol. 16, no. 7, pp.1110-1113, July 2012. [Abstract]
  10. Z. Liu, M. Li, L. Lu, C. K. Chan, S. C. Liew, and L. K. Chen, “Optical Physical-layer Network Coding,” IEEE Photonic Letters, vol. 24, no. 8, Aug 2012. [Abstract]
  11. F. Wang, S. C. Liew, and D. Guo, “Wireless MIMO Switching with Zero Forcing and Network Coding,” IEEE J. on Selected Areas in Commun., Sept 2012. [Abstract]
  12. S.-Y. R. Li, “Amazing probabilities of patterns and martingales (神奇的模式概率與 “鞅”),” in Mathematical Culture (數學文化), Global Science Press, Hong Kong, vol. 3, no. 3, pp. 73-78, Sept 2012. [Abstract]
  13. GengNian, Xiaojun Yuan, andLi Ping, “Dual-diagonal LMMSE channel estimation for OFDM systems,” IEEE Trans. Signal Processing, vol. 60, no. 9, pp. 4734-4746, Sept 2012. [Abstract]
  14. H. Yao, S. Jaggi, and M. Chen, “Network coding tomography for network failures,” IEEE Transactions on Information Theory, 58(9), pp. 5922-5940, Sept 2012. [Abstract]
  15. Yunghsiang Sam Han, Hong-Ta Pai, RongZheng, and Wai Ho Mow, “Efficient Exact Regenerating Codes for Byzantine Fault Tolerance in Distributed Networked Storage,” IEEE Transactions on Parallel and Distributed Systems, Sept 2012. [Abstract]
  16. Tao Yang, Xiaojun Yuan, and Iain B. Collings, “Reduced-dimension cooperative precoding for MIMO two-way relay channels,” IEEE Trans. Wireless Commun., Oct 2012. [Abstract]
  17. Peng Zhang, Yixin Jiang, Chuang Lin, Patrick P. C. Lee, and John C. S. Lui,“ANOC: Anonymous Network-Coding-Based Communication with Efficient Cooperation,” IEEE Journal on Selected Areas in Communications (JSAC), 30(9), pp. 1738-1745, Oct 2012. [Abstract]
  18. N. Cai, W. Guo, and Q. T. Sun, “Time-variant decoding of convolutional network codes,” IEEE Communication Letters, vol.16, no. 10, pp.1656-1659, Oct2012. [Abstract]
  19. X. Yan, R. W. Yeung, and Z. Zhang, “An implicit characterization of the achievable rate region for acyclic multisource multisink network coding,” IEEE Transactions on Information Theory, IT-58, no. 9, pp. 5625–5639, 2012. [Abstract]
  20. G. Han and B. Marcus, “Concavity of the mutual information rate for input-restricted memoryless channels at high SNR,” IEEE Transactions on Information Theory, vol. 58, no. 3, pp. 1534-1548, 2012. [Abstract]
  21. C. W. Sung, K. W. Shum,and W. H. Yuen, “Throughput analysis of one-dimensional vehicular ad hoc networks,” Int. J. of Systems, Control and Comm., vol. 4, no. 3, pp.150-163, 2012. [Abstract]
2011
  1. M. Tan, R. W. Yeung, S.-T. Ho, and N. Cai, “A unified framework for linear network coding,” IEEE Transactions on Information Theory, IT-57, no. 1, pp. 416–423, Jan., 2011. [Abstract]
  2. S.-Y. R. Li and Q. T. Sun, “Network coding theory via commutative algebra,” IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 403-415, Jan., 2011. [Abstract]
  3. N. Cai and R. W. Yeung, “Secure network coding on a wiretap network,” IEEE Transactions on Information Theory, IT-57, no. 1, pp. 424-435,Jan., 2011. [Abstract]
  4. C. K. Ngai, R. W. Yeung, and Z. Zhang, “Network generalized Hamming weight,” IEEE Transactions on Information Theory, IT-57, no. 2, pp. 1136–1143, Feb., 2011. [Abstract]
  5. T. K. Dikaliotis, T. Ho, S. Jaggi, S. Vyetrenko, H. Yao, M. Effros, J. Kliewer, E. Erez, “Multiple-access Network Information-flow and Correction Codes,” IEEE Transactions on Information Theory, Special Issue: Facets of Coding Theory: from Algorithms to Networks (in honour of Ralf Koetter), Feb., 2011. [Abstract]
  6. 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, IT-57, no. 3, pp. 1409–1424, March, 2011. [Abstract]
  7. Z. Shao and S.-Y. R. Li, “To Code or Not to Code: Rate Optimality and Complexity of Network Coding versus Routing in Peer-to-Peer Networks,” IEEE Transactions on Communications, vol. 59, no. 3, pp. 948-954, March, 2011. [Abstract]
  8. S.-Y. R. Li, Q. T. Sun and Z. Shao, “Linear Network Coding: Theory and Algorithms,” Proceedings of the IEEE, vol. 99, no. 3, pp. 372-387, March, 2011. [Abstract]
  9. S.-Y. R. Li and X. J. Tan, “Mux/demux queues, FIFO queues, and their construction by fiber memories,” IEEE Transactions on Information Theory, vol. 57, no. 3, pp. 1328-1343, March , 2011. [Abstract]
  10. R. W. Yeung, “Network coding: A historical perspective,” Proceedings of the IEEE, vol.99, no.3, pp.366-371, March 2011. [Abstract]
  11. Q. Li, X. Fan, T. Liang, and S.-Y. R. Li, “An Markov Chain Monte Carlo Algorithm for Detecting Short Adjacent Repeats Shared by Multiple Sequences,” in Bioinformatics, 27(13),1772-1779. May, 2011. [Abstract]
  12. M. Dai, C. W. Sung, and Y. Wang, “Distributed on-off power control for amplify-and-forward relays with orthogonal space-time block code,” IEEE Transactions on Wireless Communications, vol. 10, no. 6, pp. 1895-1903, June, 2011. [Abstract]
  13. C.-K. Chau, M. Chen, S. C. Liew, “Capacity of Large-scale CSMA Wireless Networks,” IEEE/ACM Trans. on Networking, vol. 19, no. 13, pp. 893-906, June, 2011. [Abstract]
  14. C. Nair and Z. Wang.” The Capacity Region of The Three Receiver Less Noisy Broadcast Channel”, IEEE Transactions on Information Theory, vol. IT-57, no. 7, pp. 4058-4062, July, 2011. [Abstract]
  15. S. Sengupta, S. Liu, M. Chen, M. Chiang, J. Li, and P. A. Chou, “Peer-to-Peer Streaming Capacity”, IEEE Trans. on Information Theory, August, 2011. [Abstract]
  16. Z. Shao, M. Chen, S. Avestimehr, and S.-Y. R. Li, “Cross-layer Optimization for Wireless Networks with Deterministic Channel Models,” IEEE Transactions on Information Theory, vol.57, no.9, pp. 5840-5862, Sept., 2011. [Abstract]
  17. H. Yao, S. Jaggi, M. Chen, “Network coding tomography for network failures,” IEEE Transactions on Information Theory, Oct., 2011. [Abstract]
  18. M. Ponec, S. Sengupta, M. Chen, J. Li, and P. A. Chou, “Optimizing Multi-rate Peer-to-Peer Video Conferencing Applications”, IEEE Trans. on Multimedia, special issue on Iterative Multimedia, Oct., 2011. [Abstract]
  19. P. Wang and Li Ping, “On the capacity of MIMO cellular systems with base station cooperation”, IEEE Transitions on Wireless Communications, vol. 10, no. 11, Nov., 2011. [Abstract]
  20. N. Chandgotia, G. Han, B. Marcus, T. Meyerovitch and R. Pavlov. “One dimensional Markov random fields, Markov chains and topological Markov fields,” Proceedings of AMS, Dec 2011. [Abstract]
2010
  1. S. Zhang and S. C. Liew, “Applying Physical-layer Network Coding in Wireless Networks,” Eurasip Journal of Wireless Communications and Networking, 2010. [Abstract]
  2. S.-Y. R. Li, “Unified algebraic theory for sorting, routing, multicasting, and concentration networks,” IEEE Transactions on Communications, vol. 58, no. 1, pp. 247-256, Jan 2010.[Abstract]
  3. S. L. Fong and R. W. Yeung, “Variable-rate linear network coding,” IEEE Transactions on Information Theory, IT-56, 2618-2625, 2010. [Abstract]
  4. R. W. Yeung, “Network coding theory: An introduction” (invited paper), Frontiers of Electrical and Electronic Engineering in China, 5(3): 363-390, 2010. [Abstract]
  5. Jerry Le, John C.S. Lui and Dah-Ming Chiu. “DCAR: Distributed Coding-Aware Routing Protocol for Wireless Networks”, IEEE Transactions on Mobile Computing, 9(4), April, 2010. [Abstract]
  6. Jerry Le, John C.S. Lui and D.M. Chiu. “On the Performance Bounds of Practical Wireless Network Coding”, IEEE Transactions on Mobile Computing, 9(8), pp.1134-1146, Aug., 2010. [Abstract]
  7. C. Nair. “Capacity Regions of Two New Classes of Two-Receiver Broadcast Channels”, IEEE Transactions on Information Theory, vol IT-56, no. 9, pp. 4207-4214, Sep., 2010. [Abstract]
  8. L. Fu, H. Kim, J. Huang, S. C. Liew, M. Chiang, “Energy Conservation and Interference Mitigation: From Decoupling Property to Win-Win Strategy,” IEEE Trans. on Wireless Communications, vol. 10, no.11, pp.3943-3955, Dec., 2010. [Abstract]
  9. S.-W. Ho and R. W. Yeung, “On information divergence and a unified typicality,” IEEE Transactions on Information Theory, IT-56, no. 12, pp. 5893–5905, Dec.,2010. [Abstract]
  10. S.-W. Ho and R. W. Yeung, “The interplay between entropy and variational distance,” IEEE Transactions on Information Theory, IT-56, no. 12, pp. 5906–5929, Dec., 2010. [Abstract]

2011

 
 
  1. S-Y. R. Li, G. Han and Y. Yang, “Prime Factorization Theory of Networks”, published by National Defense Industry Press, 2011, pages 1-102. [Abstract]

2011 

  1. G. Han, B. Marcus and Y. Peres, “A Complex Hilbert Metric and Applications to Domain of Analyticity for Entropy Rate of Hidden Markov Processes. Entropy of Hidden Markov Processes and Connections to Dynamical Systems”, London Mathematical Society Lecture Note Series, Vol. 385, edited by B.Marcus, K.Petersen and T.Weissman, 2011, pages 98-116. [Abstract]
  2. S. Jaggi, M. Langberg, “Network Security”, in Network Coding: Fundamentals and Applications, Elsevier Inc., 2011. [Abstract]
2012
  1. M.H.M. Costa and C. Nair, “On the achievable rate sum for symmetric Gaussian interference channels,” 2012 Information Theory and Applications Workshop (ITA2012), San Diego, California, USA, Feb 2012. [Abstract]
  2. Yuchong Hu, Henry C. H. Chen, Patrick P. C. Lee, and Yang Tang, “NCCloud: Applying Network Coding for the Storage Repair in a Cloud-of-Clouds,” Proceedings of the 10th USENIX Conference on File and Storage Technologies (FAST 2012), San Jose, CA, Feb 2012. [Abstract]
  3. C. Nair, “Upper concave envelopes and broadcast channels,” 2012 Information Theory and Applications Workshop (ITA2012), San Diego, California, USA, Feb 2012.[Abstract]
  4. K. W. Shum and Y. Hu, “Repair-by-transfer in distributed storage system,” Information Theory and Applications Workshop, San Diego, Feb 2012. [Abstract]
  5. F. Tekin, T. Ho, and S. Jaggi, “On erasure correction coding for streaming,” Proceedings of Information Theory and Applications Workshop, Feb 2012. [Abstract]
  6. R. W. Yeung, “A unification of network coding and routing,” 2012 Information Theory and Applications Workshop (ITA2012), San Diego, California, USA, Feb 2012. [Abstract]
  7. LiqunFu, Ying Jun (Angela) Zhang, and Jianwei Huang, “Energy Efficient Transmissions in MIMO Cognitive Radio Networks,” Proceedings of IEEE 46th Annual Conference on Information Sciences and Systems (CISS), Princeton, New Jersey, US, Mar 2012. [Abstract]
  8. T. Lu and M. Chen, “Simple and Effective Dynamic Provisioning for Power-Proportional Data Centers,” (invited), Proceedings of the 46th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, USA, Mar 2012. [Abstract]
  9. M. Chen and K. Ramchandran, “Reverse-Engineering BitTorrent: A Markov Approximation Perspective,” Proceedings of IEEE INFOCOM (mini-conference), Orlando, Florida, USA, Mar 2012. [Abstract]
  10. W. Jiang, T. Lan, S. Ha, M. Chen, and M. Chiang, “Joint VM Placement and Routing for Data Center Traffic Engineering,” Proceedings of IEEE INFOCOM (mini-conference), Orlando, Florida, USA, Mar 2012.[Abstract]
  11. Yunghsiang S. Han, Rong Zheng, and Wai Ho Mow, “Exact Regenerating Codes for Byzantine Fault Tolerance in Distributed Storage,” IEEE International Conference on Computer Communications (INFOCOM2012), Orlando, Florida, USA, Mar2012.[Abstract]
  12. F. Wang, J. Liu, and M. Chen, “CALMS: Migration towards Cloud-Assisted Live Media Streaming,” IEEE International Conference on Computer Communications (INFOCOM 2012), Orlando, Florida, USA, Mar 2012. [Abstract]
  13. Jianfei Cao, Zhangdui Zhong, and Fanggang Wang, “Regenerative Multi-way Relaying: Relay Precoding and Ordered MMSE-SIC Receiver,” IEEE VTC, May 2012. [Abstract]
  14. Ho Yee Cheung, Tsz Chiu Kwok, and Lap Chi Lau, “Fast Matrix Rank Algorithms and Applications,” Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012), New York, USA, May 2012. [Abstract]
  15. L. Lu, T. Wang, S. C. Liew, and S. Zhang, “Implementation of Physical-layer Network Coding,” IEEE International Conference on Communications (ICC), June 2012. [Abstract]
  16. S. Li, J. Huang, and S.-Y. R. Li, “Revenue Maximization of Monopoly Cognitive Virtual Network Operator,” Proceedings of IEEE International Conference on Communications (ICC), Ottawa, Canada, pp. 1-6, June 2012. [Abstract]
  17. S. Agnihotri, S. Jaggi and M. Chen, “Analog Network Coding in General SNR Regime: Performance of A Greedy Scheme,” Proceedings of International Symposium on Network Coding 2012 (NetCod2012), Cambridge, MA, USA, June 2012. [Abstract]
  18. Xiaolin Li and Wai Ho Mow, “The Precoding Problem for Sparse Random Linear Network Coding,” Proceedings of International Symposium on Network Coding 2012 (NetCod2012), Cambridge, MA, USA, June 2012. [Abstract]
  19. Q. T. Sun, “Variable-rate, static and universal generic linear network codes,” Proceedings of International Symposium on Network Coding 2012 (NetCod2012), Cambridge, MA, USA, June2012. [Abstract]
  20. Q. Yu,C. W. Sung and T. H. Chan, “Repair topology design for distributed storage systems,” Proceedings of IEEE International Conference on Communications (ICC), Ottawa, Canada, June 2012. [Abstract]
  21. Fanggang Wang and Chung Chan, “Variational-distance-based Modulation Classifier,” IEEE ICC 2012 workshop CoCoNet, June 2012. [Abstract]
  22. Miao Wang and Fanggang Wang, “Queue-aware Power Allocation for Multi-way Relay Networks,” IEEE International Conference on Communications (ICC) workshop CoCoNet, June 2012. [Abstract]
  23. R. W. Yeung, “Implementation of Network Coding in Storage Systems and in Software Radio,” 2012 International Symposium on Network Coding (NetCod2012), Cambridge, MA, June 2012. [Abstract]
  24. Chung Chan, “Universal secure network coding by non-linear secret key agreement.” 2012 International Symposium on Network Coding (NetCod2012), MIT, Cambridge, MA, USA, June 2012. [Abstract]
  25. S. Fong, R. W. Yeung and G. Kramer, “Cut-Set Bound for Generalized Networks,” 2012 IEEE International Symposium on Information Theory, Cambridge, MA, July 2012. [Abstract]
  26. S. Fong and R. W. Yeung, “Cut-Set Bound for Generalized Networks with Positive Delay,” 2012 IEEE International Symposium on Information Theory, Cambridge, MA, July 2012. [Abstract]
  27. F. Cheng, R. W. Yeung, and K. Shum, “Imperfect Secrecy in Wiretap Channel II,” 2012 IEEE International Symposium on Information Theory, Cambridge, MA, July 2012. [Abstract]
  28. T. Chan, D. Guo, and R. W. Yeung, “Entropy functions and determinant inequalities,” 2012 IEEE International Symposium on Information Theory, Cambridge, MA, July 2012. [Abstract]
  29. M. J. Siavoshani, S. Yang, and R. W. Yeung, “Non-coherent Network Coding: An Arbitrarily Varying Channel Approach,” 2012 IEEE International Symposium on Information Theory, Cambridge, MA, July 2012. [Abstract]
  30. F. Wang, S. C. Liew, and D. Guo, “Wireless MIMO Switching with MMSE Relaying,” 2012 IEEE International Symposium on Information Theory Proceedings (ISIT 2012),Cambridge, MA, USA, July 2012. [Abstract]
  31. Chung Chan, “Matroidal Undirected Network,” 2012 IEEE International Symposium on Information Theory Proceedings (ISIT 2012), Cambridge, MA, USA, July 2012. [Abstract]
  32. Chung Chan, “Agreement of a restricted secret key.” 2012 IEEE International Symposium on Information Theory Proceedings (ISIT2012). Cambridge, MA, USA, July 2012. [Abstract]
  33. Y.Geng andC. Nair, “ The capacity region of the two-receiver vector Gaussian broadcast channel with private and common messages,” 2012 IEEE International Symposium on Information Theory (ISIT2012), Cambridge, MA, USA, pp. 591-595, July 2012. [Abstract]
  34. T. Dikaliotis, H. Yao, T. Ho, S. Jaggi, and S. Avestimehr, “Low-Complexity Near-Optimal Codes for Gaussian Relay Networks,” SPCOM , Bangalore, India, July 2012. [Abstract]
  35. C. L. Chan, S. Jaggi, V. Saligrama, and S. Agnihotri, “Non-adaptive Group Testing: Explicit bounds and novel algorithms,” 2012 IEEE International Symposium on Information Theory (ISIT 2012), Cambridge, MA, USA, July 2012. [Abstract]
  36. B. K. Dey, S. Jaggi, Michael Langberg and A. D. Sarwate, “Improved Upper Bounds on the Capacity of Binary Channels with Causal Adversaries,” 2012 IEEE International Symposium on Information Theory (ISIT 2012), Cambridge, MA, USA, July 2012. [Abstract]
  37. C. Nair and L. Xia, “On Three-Receiver more capable channels,” 2012 IEEE International Symposium on Information Theory (ISIT 2012), Cambridge, MA, USA, pp. 383-387, July 2012. [Abstract]
  38. Gohari, C. Nair, and V. Anantharam, “On Marton’s inner bound for broadcast channels,” 2012 IEEE International Symposium on Information Theory (ISIT 2012), Cambridge, MA, USA, pp. 586-590, July 2012. [Abstract]
  39. K. W. Shum and Y. Hu, “Functional-repair-by-transfer regenerating codes,” 2012 IEEE International Symposium on Information Theory (ISIT 2012), Cambridge, MA, USA, July 2012. [Abstract]
  40. Jianwen Zhang, Xiaojun Yuan, and Li Ping, “Hermitian precoding for distributed MIMO systems,” 2012 IEEE International Symposium on Information Theory (ISIT2012), Cambridge, MA, USA, July 2012. [Abstract]
  41. K. Lam, C. Chau, M. Chen, and S. Liew, “Mixing Time and Temporal Starvation of General CSMA Networks with Multiple Frequency Agility,” 2012 IEEE International Symposium on Information Theory (ISIT 2012), Cambridge, MA, USA, July 2012. [Abstract]
  42. S. Agnihotri, S. Jaggi, and M. Chen, “Analog Network Coding in General SNR Regime,” 2012 IEEE International Symposium on Information Theory (ISIT 2012), Cambridge, MA, USA,July 2012. [Abstract]
  43. S.-Y. R. Li, “A unified algebraic theory for sorting, routing, multicasting, and concentration networks,” IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC 2012), 3 pages, Beijing, Sept2012. [Abstract]
  44. K. W. Shum, M. Dai, and C. W. Sung, “Broadcasting with coded side information,” Proceedings 2nd International Workshop on Network Coding in Wireless Relay Networks (NRN), Sydney, Sept  2012. [Abstract]
  45. S. L. Fong, Li P., and C. W. Sung, “Amplify‐and‐modulo for Gaussian two‐way relay channel,” Proceedings 2nd International Workshop on Network Coding in Wireless Relay Networks (NRN), Sydney, Sept 2012. [Abstract]
  46. S. Agnihotri, S. Jaggi, and M. Chen, “Analog Network Coding in General SNR Regime: Performance of Network Simplification,” Proceedings of IEEE Information Theory Workshop 2012, Lausanne, Switzerland, Sept 2012. [Abstract]
  47. Tao Yang, Xiaojun Yuan, and Iain B. Collings, “Reduced-dimension-reduction based eigen-direction alignment precoding for MIMO two-way relay channels,” Proceedings PIMRC 2012, Sydney, Australia, Sept 2012. [Abstract]
  48. Q. T. Sun and J. Yuan, “Lattice network codes based on Eisenstein integers,” IEEE WiMob, Barcelona, Spain, Oct 2012. [Abstract]
  49. Henry C. H. Chen and Patrick P. C. Lee, “Enabling Data Integrity Protection in Regenerating-Coding-Based Cloud Storage,” Proceedings of the 31st IEEE International Symposium on Reliable Distributed Systems (SRDS 2012), Irvine, CA, October 2012. [Abstract]
  50. M. Bakshi, S. Jaggi, S. Cai, and M. Chen, “SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits,” Proceedings of the 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton 2012), Urbana, Illinois, USA, Oct 2012. [Abstract]
  51. L.Xu, W.Shang and G.Han,“A graph theoretical approach to network encoding complexity,” 2012 International Symposium on Information Theory and its Applications, Hawaii, USA, Oct 2012. [Abstract]
  52. L. Huang and C. W. Sung, “Optimal Scheduling with Network Coding for Relay‐Aided Wireless Broadcast,” Proceedings IEEE ISPACS, Tamsui, New Taipei City, Taiwan, Nov 2012. [Abstract]
  53. F. Wang, S. C. Liew, “Wireless MIMO Switching,” IEEE Globecom2012, Dec 2012. [Abstract]
  54. S. Zhang,S. C. Liew,L. Lu, H. Wang, “Blind Known Interference with Parallel Real Valued Belief Propagation Algorithm,” IEEE Globecom 2012, Dec 2012. [Abstract]
2011
  1. Y. Geng and A. Gohari and C. Nair and Y. Yu, “On Marton’s Inner Bound for Two Receiver Broadcast Channels”, Information Theory and Applications Workshop, San Diego, Feb.2011. [Abstract]
  2. S. L. Fong and R. W. Yeung, “Capacity bounds for full-duplex two-way relay channel,” 2011 Information Theory and Applications Workshop at University of California, San Diego, Feb. 2011. [Abstract]
  3. T. Ho, S. Jaggi, S. Vyetrenko, and L. Xia, “Universal and Robust distributed Network Codes”, INFOCOM 2011, 10-15 April, 2011. [Abstract]
  4. A.A. Gohari, S. Yang, S. Jaggi, “Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources”, presented at ISIT 2011, St. Petersburg, Russia. Jul.-Aug., 2011. [Abstract]
  5. L. Lu, S. C. Liew, S. Zhang, “Optimal Decoding Algorithm for Asynchronous Physical-Layer Network Coding,” IEEE ICC, June 2011. [Abstract]
  6. Y. Liu and C. W. Sung, “A cross-layer design of network coded retransmissions in wireless relay channels,” Proc. Wireless Advanced, pp. 201-206, London, United Kingdom, June, 2011. [Abstract]
  7. S. Zhang, S. C. Liew, Q. Zhou, L. Lu, H. Wang, “Non-memoryless Analog Network Coding in Two-Way Relay Channel,” IEEE ICC, June, 2011.  [Abstract]
  8. X. Chen, M. Chen, B. Li, Y. Zhao, Y. Wu, and J. Li, “Celerity: Towards Low Delay Multiparty Conferencing over Arbitrary Network Topologies”, in Proceedings of the 21th International Workshop on Network and Operating Systems Support for Digital Audio and Video (ACM NOSSDAV 2011), Vancouver, Canada, June, 2011. [Abstract]
  9. X. Li, W. H. Mow, and Fai Lung Tsang, “Singularity Probability Analysis for Sparse Random Linear Network Coding,” 2011 International Conference on Communications (ICC’11), Kyoto, Japan, June, 2011. [Abstract]
  10. W. Chen, Y. Wang, M. Chen, and S. Liew, “On the Performance of TCP over Throughput-Optimal CSMA”, in Proceedings of the 18th ACM/IEEE International Workshop on Quality of Service (IWQoS 2011), San Jose, CA, US, June, 2011. [Abstract]
  11. H. Zhang, Z. Shao, M. Chen, and K. Ramchandran, “Optimal Neighbor Selection in BitTorrent-like Peer-to-Peer Networks”, in Proceedings of ACM SIGMETRICS, San Jose, CA, US, June, 2011. [Abstract]
  12. Q. T. Sun and S.-Y. R. Li, “Lattice classification by cut-through coding in engineering,” Second International Conference on Order, Algebra and Logics, Krakow, Poland, June, 2011. [Abstract]
  13. S. Yang and R. W. Yeung, “BATS code: Coding for a network coded fountain,” 2011 IEEE Communication Theory Workshop, Sitges, Catalonia, Spain, June, 2011. [Abstract]
  14. Q. T. Sun, S. Jaggi, and S-Y. R. Li, “Delay Invariant Convolutional Network Codes”, presented at ISIT2011, St. Petersburg, Russia. July, 2011 [Abstract]
  15. Y. Hu, C.-M. Yu, Y. K. Li, P. P. C. Lee, and J. C. S. Lui, “NCFS: On the Practicality and Extensibility of a Network-Coding-Based Distributed File System.” Proceedings of the 2011 International Symposium on Network Coding (NetCod 2011), Beijing, China, July 2011. [Abstract]
  16. C. W. Sung, K. W. Shum, and H. Y. Kwan, “On the sparsity of a linear network code for broadcast systems with feedback,” Proc. 2011 International Symposium on Network Coding (NetCod 2011), pp. 1-4, Beijing, China, Jul. 2011. [Abstract]
  17. Z. Shao, M. Chen, and S. Li, “Distributed Optimization for Combinatorial Coding Subgraph Selection Problems”, in Proceedings ofthe 2011 International Symposium on Network Coding (NetCod 2011), Beijing, China, July, 2011. [Abstract]
  18. M. Johnson, M. Chen, and K. Ramchandran, “On the Role of Network Coding in Uncoordinated Multihop Content Distribution over Ad Hoc Networks”, in Proceedings of the 2011 International Symposium on Network Coding (NetCod 2011), Beijing, China, July, 2011. [Abstract]
  19. X. Li, W. H. Mow and F.-L. Tsang, “Rank Distribution Analysis for Sparse Random Linear Network Coding,” 2011 International Symposium on Network Coding (NetCod 2011) Beijing, China, July, 2011. [Abstract]
  20. J. Zao, Q. T. Sun, K.-K. Yen, S.-Y. R. Li, C.-H. Wang, C. Yao, T. Liang, N. A. Claude, and J. Yip, “On Optimal Unequal Error/Erasure Protection of Scalable Video Multicasting Using Randomized Linear Network Codes,” Proceedings of the 2011 International Symposium on Network Coding (NetCod 2011), No. 46, Beijing, China, July , 2011. [Abstract]
  21. C. Yao, J. K. Zao, C.-H. Wang, S.-Y. R. Li, N. A. Claude1, K.-K. Yen, “On Separatio Vectors of Static Linear Network Codes with UEP Capability,” Proceedings of the 2011 International Symposium on Network Coding (NetCod 2011), No. 73, Beijing, China, July, 2011. [Abstract]
  22. Z. Shao, M. Chen, and S.-Y. R. Li, “Distributed Optimization for Combinatorial Coding Subgraph Selection Problems,” Proceedings of the 2011 International Symposium on Network Coding (NetCod 2011), Beijing, China, July, 2011. [Abstract]
  23. Y. Li, J. C. S. Lui, “Identifying Pollution Attackers in Network-Coding Enabled Wireless Mesh Networks”, IEEE ICCCN, July -Aug. 2011. [Abstract]
  24. H. Y. Kwan, K. W. Shum, and C. W. Sung, “Generation of innovative and sparse encoding vectors for broadcast systems with feedback,” Proc. IEEE ISIT, Saint Petersburg, Russia, Jul.-Aug., 2011. [Abstract]
  25. Q. T. Sun, S. Jaggi, and S.-Y. R. Li, “’Delay Invariant Convolutional Network Codes,” Proceedings of IEEE International Symposium on Information Theory (ISIT), St. Petersburg, Russia, July -Aug., 2011. [Abstract]
  26. S. L. Fong, M. Fan, and R. W. Yeung, “Practical Network Coding on Three-Node Point-to-Point Relay Networks,” 2011 IEEE International Symposium on Information Theory, St. Petersburg, Jul – Aug, 2011. [Abstract]
  27. S. L. Fong and R. W. Yeung, “Feedback Enlarges Capacity Region of Two-Way Relay Channel,” 2011 IEEE International Symposium on Information Theory, St. Petersburg, Jul– Aug, 2011. [Abstract]
  28. S. Yang and R. W. Yeung, “Coding for a Network Coded Fountain,” 2011 IEEE International Symposium on Information Theory, St. Petersburg, Jul– Aug, 2011. [Abstract]
  29. D. Kapetanovic, H. Cheng, W. H. Mow and F. Rusek, “Optimal Lattices for MIMO Precoding,” IEEE International Symposium on Information Theory (ISIT’11), Saint Petersburg, Russia, July-August, 2011. [Abstract]
  30. T. Yang, X. Yuan, Li Ping, Iain B. Collings and Jinhong Yuan, “A New Eigen-direction Alignment Algorithm for Physical-layer Network Coding in MIMO Two-way Relay Channels”, IEEE International Symposium on Information Theory, St Petersburg Russia, Jul.-Aug., 2011. [Abstract]
  31. Y. Geng and A. Gohari and C. Nair and Y. Yu. “The Capacity Region for Two Classes of Product Broadcast Channel”, Proceedings of the International Symposium on Information Theory, St Petersburg Russia, Jul.-Aug., 2011. [Abstract]
  32. Q. Wang, S. Jaggi, S.-Y. Li, “Binary Error Correcting Network Codes”, presented at ITW 2011, Paraty, Brazil, Aug., 2011 [Abstract]
  33. W. H. Mow, “How Sparse can a Decodable Subspace Network Code be?” 2011 Taiwan-HK Joint Workshop on Information Theory & Communication, Kaoshiung, Taiwan, Aug. 2011. [Abstract]
  34. F. Wang, S. C. Liew, D. Guo, “Wireless MIMO Switching with Zero-forcing Relaying, ” Allerton 2011, Sep., 2011. [Abstract]
  35. S. Q. Li and S.-Y. R. Li, “Pricing and revenue management in communication networks,” submitted to the IEEE International Conference on Industrial Engineering and Engineering Management (IE&EM 2011), Changchun, China, 5 pages, Sep., 2011. [Abstract]
  36. L. Xu and G. Han.“ Bounds and Exact Values in Network Encoding Complexity”. Forty-Ninth Annual Allerton Conference on Communication, Control, and Computing, Sep., 2011, Allerton Retreat Center, Monticello, Illinois. [Abstract]
  37. L. Huang and C. W. Sung, “‘An iterative routing algorithm for energy minimization in coded wireless networks,” Proc. IEEE PIMRC, Toronto, Canada, Sep., 2011. [Abstract]
  38. S. Agnihotri, S. Jaggi, and M. Chen, “Amplify-and-Forward in Wireless Relay Networks”, presented at ITW 2011, Paraty, Brazil. Oct., 2011 [Abstract]
  39. S. Yang and R. W. Yeung, “Large file transmission in network-coded networks with packet loss – A performance perspective,” 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, Barcelona, Oct., 2011. [Abstract]
  40. Q. Yu, K. W. Shum, and C. W. Sung, “Minimization of storage cost in distributed storage systems with repair consideration,” to appear in Proc. IEEE GLOBECOM, Houston, Texas, USA, Dec., 2011. [Abstract]
  41. C. Chan, “The hidden flow of information,” in 2011 IEEE International Symposium on Information Theory Proceedings (ISIT2011), St. Petersburg, Russia, Jul. 2011. [Abstract]
  42. C. Chan, “Linear perfect secret key agreement,” in 2011 IEEE Information Theory Workshop Proceedings (ITW2011), Paraty, Brazil, Oct. 2011. [Abstract]
  43. C. Chan, “Multiterminal secure source coding for a common secret source,” in Forty-Ninth Annual Allerton Conference on Communication, Control, and Computing, Allerton Retreat Center, Monticello, Illinois, Sep. 2011. [Abstract]
  44. C. Chan,“Delay of linear perfect secret key agreement,” in Forty-Ninth Annual Allerton Conference on Communication, Control, and Computing, Allerton Retreat Center, Monticello, Illinois, Sep. 2011. [Abstract]
2010
  1. H. Yao and R. W. Yeung, “Zero-error multichannel source coding,” 2010 IEEE Information Theory Workshop, Jan 6-8, 2010. [Abstract]
  2. S. Zhang and S. C. Liew, “Physical Layer Network Coding with Multiple Antennas,” IEEE WCNC 2010, Apr 2010. [Abstract]
  3. L. Lu, S. C. Liew, S. Zhang, “Channel-coded Collision Resolution by Exploiting Symbol Misalignment,” IEEE ICC, May 2010. [Abstract]
  4. R. W. Yeung, “Network Coding: An Overview,” 2010 IEEE Int’l Conference on Communication, Cape Town, South Africa, May 23-27, 2010. [Abstract]
  5. Y. Li, H. Yao, M. Chen, S. Jaggi, and A. Rosen, “Ripple Authentication for Network Coding,” 2010 IEEE Int’l Symposium on Network Coding, Toronto, Canada, June 9-11, 2010. [Abstract]
  6. H. Yao, S. Jaggi and M. Chen, “Network Coding Tomography for Network Failures,” 2010 IEEE Int’l Symposium on Network Coding, Toronto, Canada, June 9-11, 2010. [Abstract]
  7. A. Bakshi, S. Jaggi and N. Effros,” Concatenated Polar Codes,” 2010 IEEE Int’l Symposium on Network Coding, Toronto, Canada, June 9-11, 2010. [Abstract]
  8. H. Yao, D. Silva, S. Jaggi and M. Langberg, “Network Codes Resilient to Jamming and Eavesdropping,” 2010 IEEE Int’l Symposium on Information Theory, Austin, Texas, June 13-18, 2010. [Abstract]
  9. B. K. Dey, S. Jaggi, M. Langberg, and A. D. Sarwate, “Coding against delayed adversaries,” 2010 IEEE Int’l Symposium on Information Theory, Austin, Texas, June 13-18, 2010. [Abstract]
  10. K. W. Shum and W. S. Wong, “Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee,” 2010 IEEE Information Symposium on Info. Theory, Austin, Texas, June 13-18, 2010. [Abstract]
  11. Y. Geng, C. Nair, S. Shamai (Shitz), and Z. V. Wang, “On broadcast channels with binary inputs and symmetric outputs,” 2010 IEEE Int’l Symposium on Info Theory, Austin, Texas, June 13-18, 2010. [Abstract]
  12. Z. V. Wang and C. Nair, “The capacity region of a class of broadcast channels with a sequence of less noisy receivers”, 2010 IEEE Int’l Symposium on Info Theory, Austin, Texas, June 13-18, 2010. [Abstract]
  13. Y. Geng, C. Nair, and Z. V. Wang, “An information inequality and evaluation of Marton’s inner bound for binary input broadcast channels,” 2010 IEEE Int’l Symposium on Info Theory, Austin, Texas, June 13-18, 2010. [Abstract]
  14. F. L. Tsang and W. H. Mow, “A Submodule Coding Framework for Generic Random Linear Network Coding,” 2010 IEEE International Symposium on Information Theory (ISIT’10), recent Result Session, Austin, Texas, USA, 13-18 Jun 2010. [Abstract]
  15. S. C. Liew, “Physical-layer Networking Coding: A Survey of Its Research Landscape,” Kumar Chair Professor Group’s Special Workshop on New Directions in Wireless Communications and Networking, jointly organized with Ho Chair Professor Group, Tsinghua University, Tsinghua University, 9-11 July, 2010. [Abstract]
  16. M. L. Ma and J. Y. B. Lee, “Multi-Source Scheduling in Streaming Erasure-Coded Video over P2P Networks,” 2010 IEEE Int’l Conference on Peer to Peer Computing, Delft, Netherlands, 25-27 Aug, 2010. [Abstract]
  17. H. Yao, T. K. Dikaliotis, S. Jaggi, and T. Ho, “Multiple Access Network Information-flow and Correction codes,” 2010 IEEE Information Theory Workshop, Dublin, Ireland, 30 Aug – 03 Sept 2010. [Abstract]
  18. K. W. Shum, Y. Zhang and W. S. Wong, “User-Irrepressible Sequences,” SETA 2010, Paris, France, Sept 12-17, 2010. [Abstract]
  19. S, Zhang, S.C. Liew, L. Lu, H. Wang, “Suppress Interference by Symbol-misalignment,” 5th Int. Conf. Communications and Networkingin China, ChinaCom 2010, Aug. 2010. [Abstract]
  20. S. Zhang, Z. Shao, and M. Chen, “Optimal Distributed P2P Streaming under Node Degree Bounds”, in Proceedings of the 18th IEEE International Conference on Network Protocols (ICNP 2010), Kyoto, Japan, Oct. 2010. [Abstract]
  21. H. Yao, S. Jaggi, M. Chen, and T. Ho, “Network RS codes for Efficient Network Adversary Localization,” Asilomar Conference on Signals, Systems and Computer, Pacific Grove, California, Nov 7-11, 2010. [Abstract]
  22. L. Fu, H. Kim, J. Huang, S. C. Liew, M. Chiang, “Energy Conservation and Interference Mitigation: From Decoupling Property to Win-Win Strategy,” IEEE Conference on Decision and Control, Dec 2010 [Abstract]