Research
My research interests span information theory and coding for network communication, security, and computation; quantum information and computation; and AI theory and systems. The pages below introduce a selection of these topics.
⇌Coding-based Network Communications
Network communications are facing increasing challenges from emerging applications with low-latency and high-throughput communication demands. Limitations of Traditional Network Communications Traditional network communication technologies, represented by TCP/…
⇄Batched Network Coding
We invented BATS (Batched Sparse) codes, a class of batched network coding schemes that combine low-complexity encoding/decoding with near-optimal throughput over multi-hop networks. BATS codes have been implemented in real-world systems and are a strong candi…
◷Wireless Networking with Propagation Delay
Signal propagation delay has traditionally been ignored or treated as an adverse factor in wireless communications. Our recent work shows it can be exploited as a new dimension for scheduling media access and can significantly improve network throughput. We de…
⊕Shift-XOR Codes
Finite-field operations dominate most coding designs but are not always feasible or favorable due to computation cost. We design codes using only (non-cyclic) shifts and XOR operations, achieving performance comparable to or better than corresponding finite-fi…
⌁Optimal Finite-Length Codes
For a binary symmetric channel with maximum-likelihood decoding, the problem of finding the optimal code with fixed blocklength and codebook size is open in general. We solve the problem for codes of four codewords and blocklength up to 8 analytically, and up …
∑Network Function Computation
We study computing functions of distributed sources over networks — a fundamental problem at the intersection of information theory and network computation. Our work characterizes the fundamental limits and designs efficient computation schemes for networked s…
Publications
See my publications on Google Scholar, dblp and ORCID, or browse the full list on this site.