23 citations · 89 across the 18 of their papers we have counts for
26 papers
Adaptive relaying for streaming erasure codes in a three node relay network
Gustavo Kasper Facenda, M. Nikhil Krishnan, Elad Domanovitz +4
This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source node transmits a sequence of message packets to a destination through…
Low-Latency Network-Adaptive Error Control for Interactive Streaming
Salma Emara, Silas L. Fong, Baochun Li +4
We introduce a novel network-adaptive algorithm that is suitable for alleviating network packet losses for low-latency interactive communications between a source and a destination…
An Explicit Construction of Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures
Damian Dudzicz, Silas L. Fong, Ashish Khisti
This paper presents a new construction of error correcting codes which achieves optimal recovery of a streaming source over a packet erasure channel. The channel model considered i…
An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures
Elad Domanovitz, Silas L. Fong, Ashish Khisti
This paper considers the transmission of an infinite sequence of messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly…
Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays
Silas L. Fong, Ashish Khisti, Baochun Li +3
This paper considers multiplexing two sequences of messages with two different decoding delays over a packet erasure channel. In each time slot, the source constructs a packet base…
Optimal Streaming Erasure Codes over the Three-Node Relay Network
Silas L. Fong, Ashish Khisti, Baochun Li +3
This paper investigates low-latency streaming codes for a three-node relay network. The source transmits a sequence of messages (streaming messages) to the destination through the…
Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit
Silas L. Fong, Jing Yang, Aylin Yener
An additive white Gaussian noise energy-harvesting channel with an infinite-sized battery is considered. The energy arrival process is modeled as a sequence of independent and iden…
Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures
Silas L. Fong, Ashish Khisti, Baochun Li +3
This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current…
Scaling Exponent and Moderate Deviations Asymptotics of Polar Codes for the AWGN Channel
Silas L. Fong, Vincent Y. F. Tan
This paper investigates polar codes for the additive white Gaussian noise (AWGN) channel. The scaling exponent of polar codes for a memoryless channel with capacity $…
A Tight Upper Bound on the Second-Order Coding Rate of the Parallel Gaussian Channel with Feedback
Silas L. Fong, Vincent Y. F. Tan
This paper investigates the asymptotic expansion for the maximum rate of fixed-length codes over a parallel Gaussian channel with feedback under the following setting: A peak power…
On Achievable Rates of AWGN Energy-Harvesting Channels with Block Energy Arrival and Non-Vanishing Error Probabilities
Silas L. Fong, Vincent Y. F. Tan, Ayfer Özgür
This paper investigates the achievable rates of an additive white Gaussian noise (AWGN) energy-harvesting (EH) channel with an infinite battery. The EH process is characterized by…
Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound
Silas L. Fong, Vincent Y. F. Tan
This paper considers a multimessage network where each node may send a message to any other node in the network. Under the discrete memoryless model, we prove the strong converse t…
Achievable Rates for Gaussian Degraded Relay Channels with Non-Vanishing Error Probabilities
Silas L. Fong, Vincent Y. F. Tan
This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link tha…
On the Scaling Exponent of Polar Codes for Binary-Input Energy-Harvesting Channels
Silas L. Fong, Vincent Y. F. Tan
This paper investigates the scaling exponent of polar codes for binary-input energy-harvesting (EH) channels with infinite-capacity batteries. The EH process is characterized by a…
On Gaussian Channels with Feedback under Expected Power Constraints and with Non-Vanishing Error Probabilities
Lan V. Truong, Silas L. Fong, Vincent Y. F. Tan
In this paper, we consider single- and multi-user Gaussian channels with feedback under expected power constraints and with non-vanishing error probabilities. In the first of two c…
Empirical Output Distribution of Good Delay-Limited Codes for Quasi-Static Fading Channels
Silas L. Fong, Vincent Y. F. Tan
This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length- delay-limited codes for a quasi-stat…
A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality
Silas L. Fong, Vincent Y. F. Tan
We prove that the Gaussian broadcast channel with two destinations admits the strong converse property. This implies that for every sequence of block codes operated at a common rat…
Non-Asymptotic Achievable Rates for Energy-Harvesting Channels using Save-and-Transmit
Silas L. Fong, Vincent Y. F. Tan, Jing Yang
This paper investigates the information-theoretic limits of energy-harvesting (EH) channels in the finite blocklength regime. The EH process is characterized by a sequence of i.i.d…
Cut-Set Bounds for Multimessage Multicast Networks with Independent Channels and Zero-Delay Edges
Silas L. Fong
We consider a communication network consisting of nodes and directed edges that connect the nodes. The network may contain cycles. The communications are slotted where the duration…
A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels
Silas L. Fong, Vincent Y. F. Tan
We prove the strong converse for the -source Gaussian multiple access channel (MAC). In particular, we show that any rate tuple that can be supported by a sequence of codes with…
Asymptotic Expansions for Gaussian Channels with Feedback under a Peak Power Constraint
Silas L. Fong, Vincent Y. F. Tan
This paper investigates the asymptotic expansion for the size of block codes defined for the additive white Gaussian noise (AWGN) channel with feedback under the following setting:…
Classes of Delay-Independent Multimessage Multicast Networks with Zero-Delay Nodes
Silas L. Fong
In a network, a node is said to incur a delay if its encoding of each transmitted symbol involves only its received symbols obtained before the time slot in which the transmitted s…
Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach
Silas L. Fong, Vincent Y. F. Tan
This paper establishes that the strong converse holds for some classes of discrete memoryless multimessage multicast networks (DM-MMNs) whose corresponding cut-set bounds are tight…
Cut-Set Bounds for Networks with Zero-Delay Nodes
Silas L. Fong, Raymond W. Yeung
In a network, a node is said to incur a delay if its encoding of each transmitted symbol involves only its received symbols obtained before the time slot in which the transmitted s…