Xiugang Wu

Orcid: 0000-0002-8130-975X

According to our database1, Xiugang Wu authored at least 23 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover.
IEEE Trans. Inf. Theory, April, 2023

2021
Understanding Entropic Regularization in GANs.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Minimax Learning for Distributed Inference.
IEEE Trans. Inf. Theory, 2020

2019
"The Capacity of the Relay Channel": Solution to Cover's Problem in the Gaussian Case.
IEEE Trans. Inf. Theory, 2019

New Upper Bounds on the Capacity of Primitive Diamond Relay Channels.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

2018
Cut-Set Bound is Loose for Gaussian Relay Networks.
IEEE Trans. Inf. Theory, 2018

An Isoperimetric Result on High-Dimensional Spheres.
CoRR, 2018

Minimax Learning for Remote Prediction.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets.
IEEE Trans. Inf. Theory, 2017

The geometry of the relay channel.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A solution to cover's problem for the binary symmetric relay channel: Geometry of sets on the hamming sphere.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
STAC: Simultaneous Transmitting and Air Computing in Wireless Data Center Networks.
IEEE J. Sel. Areas Commun., 2016

Improving on the cut-set bound for general primitive relay channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Cover's open problem: "The Capacity of the Relay Channel".
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Upper bounds on the capacity of symmetric primitive relay channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
A Unified Relay Framework With Both D-F and C-F Relay Nodes.
IEEE Trans. Inf. Theory, 2014

2013
Coding Schemes for Multiple-Relay Channels.
PhD thesis, 2013

On the Optimal Compressions in the Compress-and-Forward Relay Schemes.
IEEE Trans. Inf. Theory, 2013

2010
An Optimality-Robustness Tradeoff in the Compress-and-Forward Relay Scheme.
Proceedings of the 72nd IEEE Vehicular Technology Conference, 2010

AEP of Output when Rate is above capacity: The Gaussian case.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Codebook information does not reduce output entropy when rate is above capacity.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

On the optimality of successive decoding in compress-and-forward relay schemes.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Asymptotic Equipartition Property of Output when Rate is above Capacity
CoRR, 2009


  Loading...