Silas L. Fong

IEEE Trans. Inf. Theory, July, 2023

2022

Low-Latency Network-Adaptive Error Control for Interactive Streaming.

[BibT_eX]

[DOI]

IEEE Trans. Multim., 2022

Corrections to "Optimal Streaming Erasure Codes Over the Three-Node Relay Network".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures.

[BibT_eX]

[DOI]

Elad Domanovitz

Ashish Khisti

IEEE Trans. Inf. Theory, 2022

On State-Dependent Streaming Erasure Codes over the Three-Node Relay Network.

[BibT_eX]

[DOI]

Gustavo Kasper Facenda

Proceedings of the IEEE International Symposium on Information Theory, 2022

2020

Optimal Multiplexed Erasure Codes for Streaming Messages With Different Decoding Delays.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Optimal Streaming Erasure Codes Over the Three-Node Relay Network.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures.

[BibT_eX]

[DOI]

Damian Dudzicz

Ashish Khisti

IEEE Trans. Commun., 2020

2019

Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Save-and-Transmit and Best-Effort.

[BibT_eX]

[DOI]

Aylin Yener

IEEE Trans. Inf. Theory, 2019

Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2019

2018

On Achievable Rates of AWGN Energy-Harvesting Channels With Block Energy Arrival and Non-Vanishing Error Probabilities.

[BibT_eX]

[DOI]

Ayfer Özgür

IEEE Trans. Inf. Theory, 2018

Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit.

[BibT_eX]

[DOI]

Aylin Yener

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.

[BibT_eX]

[DOI]

Lan V. Truong

IEEE Trans. Inf. Theory, 2017

A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

A Tight Upper Bound on the Second-Order Coding Rate of the Parallel Gaussian Channel With Feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

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

[BibT_eX]

[DOI]

Entropy, 2017

A tight upper bound on the second-order coding rate of parallel Gaussian channels with feedback.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Strong converse theorems for discrete memoryless networks with tight cut-set bound.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Cut-Set Bounds for Multimessage Multicast Networks With Independent Channels and Zero-Delay Edges.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Classes of Delay-Independent Multimessage Multicast Networks With Zero-Delay Nodes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Non-Asymptotic Achievable Rates for Energy-Harvesting Channels Using Save-and-Transmit.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2016

On the Scaling Exponent of Polar Codes for Binary-Input Energy-Harvesting Channels.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2016

Output Distributions of Capacity-Achieving Codes for Gaussian Multiple Access Channels.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

On second-order asymptotics of AWGN channels with feedback under the expected power constraint.

[BibT_eX]

[DOI]

Lan V. Truong

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.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Two-Hop Interference Channels: Impact of Linear Schemes.

[BibT_eX]

[DOI]

Ibrahim Issa

Amir Salman Avestimehr

IEEE Trans. Inf. Theory, 2015

Cut-Set Bounds for Networks With Zero-Delay Nodes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Asymptotic expansions for the AWGN channel with feedback under a peak power constraint.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Cut-set bound for multimessage multicast networks with independent channels and zero-delay edges.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

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

[BibT_eX]

[DOI]

CoRR, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Cut-set bound for generalized networks with deterministic channels.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013

Cut-Set Bounds for Generalized Networks.

[BibT_eX]

[DOI]

CoRR, 2013

Two-hop interference channels: Impact of linear time-varying schemes.

[BibT_eX]

[DOI]

Ibrahim Issa

Amir Salman Avestimehr

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Amplify-and-modulo for Gaussian two-way relay channel.

[BibT_eX]

[DOI]

Li Ping

Chi Wan Sung

Proceedings of the 23rd IEEE International Symposium on Personal, 2012

Cut-set bound for generalized networks.

[BibT_eX]

[DOI]

Gerhard Kramer

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Cut-set bound for generalized networks with positive delay.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

On the benefit of network coding in wireless relay networks.

[BibT_eX]

[DOI]

Lik Hang Silas Fong

PhD thesis, 2011

Capacity bounds for full-duplex two-way relay channel with feedback.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

Feedback enlarges capacity region of two-way relay channel.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Practical network coding on three-node point-to-point relay networks.

[BibT_eX]

[DOI]

Mingxi Fan

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Variable-rate linear network coding.

[BibT_eX]

[DOI]