Silas L. Fong

According to our database1, Silas L. Fong authored at least 44 papers between 2010 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Optimal Multiplexed Erasure Codes for Streaming Messages With Different Decoding Delays.
IEEE Trans. Inf. Theory, 2020

Optimal Streaming Erasure Codes Over the Three-Node Relay Network.
IEEE Trans. Inf. Theory, 2020

An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures.
IEEE Trans. Commun., 2020

2019
Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures.
IEEE Trans. Inf. Theory, 2019

Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Save-and-Transmit and Best-Effort.
IEEE Trans. Inf. Theory, 2019

Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound.
Probl. Inf. Transm., 2019

Low-Latency Network-Adaptive Error Control for Interactive Streaming.
Proceedings of the 27th ACM International Conference on Multimedia, 2019

An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

2018
On Achievable Rates of AWGN Energy-Harvesting Channels With Block Energy Arrival and Non-Vanishing Error Probabilities.
IEEE Trans. Inf. Theory, 2018

Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
On Gaussian Channels With Feedback Under Expected Power Constraints and With Non-Vanishing Error Probabilities.
IEEE Trans. Inf. Theory, 2017

A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality.
IEEE Trans. Inf. Theory, 2017

A Tight Upper Bound on the Second-Order Coding Rate of the Parallel Gaussian Channel With Feedback.
IEEE Trans. Inf. Theory, 2017

Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities.
IEEE Trans. Inf. Theory, 2017

Scaling Exponent and Moderate Deviations Asymptotics of Polar Codes for the AWGN Channel.
Entropy, 2017

A tight upper bound on the second-order coding rate of parallel Gaussian channels with feedback.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Strong converse theorems for discrete memoryless networks with tight cut-set bound.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach.
IEEE Trans. Inf. Theory, 2016

A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels.
IEEE Trans. Inf. Theory, 2016

Cut-Set Bounds for Multimessage Multicast Networks With Independent Channels and Zero-Delay Edges.
IEEE Trans. Inf. Theory, 2016

Classes of Delay-Independent Multimessage Multicast Networks With Zero-Delay Nodes.
IEEE Trans. Inf. Theory, 2016

Non-Asymptotic Achievable Rates for Energy-Harvesting Channels Using Save-and-Transmit.
IEEE J. Sel. Areas Commun., 2016

On the Scaling Exponent of Polar Codes for Binary-Input Energy-Harvesting Channels.
IEEE J. Sel. Areas Commun., 2016

Output Distributions of Capacity-Achieving Codes for Gaussian Multiple Access Channels.
IEEE Commun. Lett., 2016

Strong Converse for Discrete Memoryless Networks with Tight Cut-Set Bounds.
CoRR, 2016

On second-order asymptotics of AWGN channels with feedback under the expected power constraint.
Proceedings of the IEEE International Symposium on Information Theory, 2016

A non-asymptotic achievable rate for the AWGN energy-harvesting channel using save-and-transmit.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Two-Hop Interference Channels: Impact of Linear Schemes.
IEEE Trans. Inf. Theory, 2015

Cut-Set Bounds for Networks With Zero-Delay Nodes.
IEEE Trans. Inf. Theory, 2015

Asymptotic expansions for the AWGN channel with feedback under a peak power constraint.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Cut-set bound for multimessage multicast networks with independent channels and zero-delay edges.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Asymptotic Expansions for Gaussian Channels with Feedback under a Peak Power Constraint.
CoRR, 2014

Classes of Delay-Independent Multimessage Multicast Networks under the Generalized Model.
CoRR, 2014

Cut-set bound for generalized networks with deterministic channels.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013
Cut-Set Bounds for Generalized Networks.
CoRR, 2013

Two-hop interference channels: Impact of linear time-varying schemes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Amplify-and-modulo for Gaussian two-way relay channel.
Proceedings of the 23rd IEEE International Symposium on Personal, 2012

Cut-set bound for generalized networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Cut-set bound for generalized networks with positive delay.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
On the benefit of network coding in wireless relay networks.
PhD thesis, 2011

Capacity bounds for full-duplex two-way relay channel with feedback.
Proceedings of the Information Theory and Applications Workshop, 2011

Feedback enlarges capacity region of two-way relay channel.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Practical network coding on three-node point-to-point relay networks.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Variable-rate linear network coding.
IEEE Trans. Inf. Theory, 2010


  Loading...