Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSilas L. Fong
Lik Hang Silas Fong
Person information
- affiliation: University of Toronto, Department of Electrical & Computer Engineering, Canada
- affiliation (PhD 2011): Chinese University of Hong Kong, Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j27]Silas L. Fong
, Juan Bucheli, Ashwin Sampath, Ahmed M. Bedewy, Michael Di Mare, Ori Shental, Muhammad Nazmul Islam:
A Mixed-Integer Linear Programming Approach to Deploying Base Stations and Repeaters. IEEE Commun. Lett. 27(12): 3414-3418 (2023)- [j26]Gustavo Kasper Facenda, M. Nikhil Krishnan, Elad Domanovitz, Silas L. Fong, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Adaptive Relaying for Streaming Erasure Codes in a Three Node Relay Network. IEEE Trans. Inf. Theory 69(7): 4345-4360 (2023) - 2022
- [j25]Elad Domanovitz, Silas L. Fong, Ashish Khisti:
An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures. IEEE Trans. Inf. Theory 68(1): 47-65 (2022) - [j24]Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Corrections to "Optimal Streaming Erasure Codes Over the Three-Node Relay Network". IEEE Trans. Inf. Theory 68(10): 6527 (2022) - [j23]Salma Emara, Silas L. Fong, Baochun Li, Ashish Khisti, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Low-Latency Network-Adaptive Error Control for Interactive Streaming. IEEE Trans. Multim. 24: 1691-1706 (2022) - [c26]Gustavo Kasper Facenda, Elad Domanovitz, M. Nikhil Krishnan, Ashish Khisti, Silas L. Fong, Wai-Tian Tan, John G. Apostolopoulos:
On State-Dependent Streaming Erasure Codes over the Three-Node Relay Network. ISIT 2022: 1951-1956 - [i24]Gustavo Kasper Facenda, M. Nikhil Krishnan, Elad Domanovitz, Silas L. Fong, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Adaptive relaying for streaming erasure codes in a three node relay network. CoRR abs/2203.05102 (2022) - 2020
- [j22]Damian Dudzicz, Silas L. Fong, Ashish Khisti:
An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures. IEEE Trans. Commun. 68(1): 12-25 (2020) - [j21]Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Streaming Erasure Codes Over the Three-Node Relay Network. IEEE Trans. Inf. Theory 66(5): 2696-2712 (2020) - [j20]Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Multiplexed Erasure Codes for Streaming Messages With Different Decoding Delays. IEEE Trans. Inf. Theory 66(7): 4007-4018 (2020)
2010 – 2019
- 2019
- [j19]Silas L. Fong, Vincent Y. F. Tan:
Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound. Probl. Inf. Transm. 55(1): 67-100 (2019) - [j18]Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures. IEEE Trans. Inf. Theory 65(7): 4274-4292 (2019) - [j17]Silas L. Fong, Jing Yang, Aylin Yener:
Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Save-and-Transmit and Best-Effort. IEEE Trans. Inf. Theory 65(11): 7233-7252 (2019) - [c25]Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Streaming Erasure Codes over the Three-Node Relay Network. ISIT 2019: 3077-3081 - [c24]Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays. ISIT 2019: 3082-3086 - [c23]Elad Domanovitz, Silas L. Fong, Ashish Khisti:
An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures. ITW 2019: 1-5 - [c22]Damian Dudzicz, Silas L. Fong, Ashish Khisti:
An Explicit Construction of Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures. ITW 2019: 1-5 - [c21]Silas L. Fong, Salma Emara, Baochun Li, Ashish Khisti, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Low-Latency Network-Adaptive Error Control for Interactive Streaming. ACM Multimedia 2019: 438-446 - [i23]Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays. CoRR abs/1901.03769 (2019) - [i22]Damian Dudzicz, Silas L. Fong, Ashish Khisti:
An Explicit Construction of Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures. CoRR abs/1903.07434 (2019) - [i21]Elad Domanovitz, Silas L. Fong, Ashish Khisti:
An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures. CoRR abs/1904.06212 (2019) - [i20]Silas L. Fong, Salma Emara, Baochun Li, Ashish Khisti, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Low-Latency Network-Adaptive Error Control for Interactive Streaming. CoRR abs/1909.06709 (2019) - 2018
- [j16]Silas L. Fong, Vincent Y. F. Tan, Ayfer Özgür:
On Achievable Rates of AWGN Energy-Harvesting Channels With Block Energy Arrival and Non-Vanishing Error Probabilities. IEEE Trans. Inf. Theory 64(3): 2038-2064 (2018) - [c20]Silas L. Fong, Jing Yang, Aylin Yener:
Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit. ISIT 2018: 871-875 - [c19]Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures. ISIT 2018: 1370-1374 - [i19]Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures. CoRR abs/1801.04241 (2018) - [i18]Silas L. Fong, Jing Yang, Aylin Yener:
Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit. CoRR abs/1805.02829 (2018) - 2017
- [j15]Silas L. Fong, Vincent Y. F. Tan:
Scaling Exponent and Moderate Deviations Asymptotics of Polar Codes for the AWGN Channel. Entropy 19(7): 364 (2017) - [j14]Lan V. Truong, Silas L. Fong, Vincent Y. F. Tan:
On Gaussian Channels With Feedback Under Expected Power Constraints and With Non-Vanishing Error Probabilities. IEEE Trans. Inf. Theory 63(3): 1746-1765 (2017) - [j13]Silas L. Fong, Vincent Y. F. Tan:
Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities. IEEE Trans. Inf. Theory 63(7): 4183-4201 (2017) - [j12]Silas L. Fong, Vincent Y. F. Tan:
A Tight Upper Bound on the Second-Order Coding Rate of the Parallel Gaussian Channel With Feedback. IEEE Trans. Inf. Theory 63(10): 6474-6486 (2017) - [j11]Silas L. Fong, Vincent Y. F. Tan:
A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality. IEEE Trans. Inf. Theory 63(12): 7737-7746 (2017) - [c18]Silas L. Fong, Vincent Y. F. Tan, Ayfer Özgür:
On achievable rates of AWGN energy-harvesting channels with block energy arrival and non-vanishing error probabilities. ISIT 2017: 814-818 - [c17]Silas L. Fong, Vincent Y. F. Tan:
Strong converse theorems for discrete memoryless networks with tight cut-set bound. ISIT 2017: 933-937 - [c16]Silas L. Fong, Vincent Y. F. Tan:
A tight upper bound on the second-order coding rate of parallel Gaussian channels with feedback. ITW 2017: 76-80 - [i17]Silas L. Fong, Vincent Y. F. Tan, Ayfer Özgür:
On Achievable Rates of AWGN Energy-Harvesting Channels with Block Energy Arrival and Non-Vanishing Error Probabilities. CoRR abs/1701.02088 (2017) - [i16]Silas L. Fong, Vincent Y. F. Tan:
A Tight Upper Bound on the Second-Order Coding Rate of Parallel Gaussian Channels with Feedback. CoRR abs/1703.05932 (2017) - [i15]Silas L. Fong, Vincent Y. F. Tan:
Scaling Exponent and Moderate Deviations Asymptotics of Polar Codes for the AWGN Channel. CoRR abs/1706.02458 (2017) - 2016
- [j10]Silas L. Fong:
Output Distributions of Capacity-Achieving Codes for Gaussian Multiple Access Channels. IEEE Commun. Lett. 20(5): 938-941 (2016) - [j9]Silas L. Fong, Vincent Y. F. Tan, Jing Yang:
Non-Asymptotic Achievable Rates for Energy-Harvesting Channels Using Save-and-Transmit. IEEE J. Sel. Areas Commun. 34(12): 3499-3511 (2016) - [j8]Silas L. Fong, Vincent Y. F. Tan:
On the Scaling Exponent of Polar Codes for Binary-Input Energy-Harvesting Channels. IEEE J. Sel. Areas Commun. 34(12): 3540-3551 (2016) - [j7]Silas L. Fong:
Classes of Delay-Independent Multimessage Multicast Networks With Zero-Delay Nodes. IEEE Trans. Inf. Theory 62(1): 384-400 (2016) - [j6]Silas L. Fong, Vincent Y. F. Tan:
A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels. IEEE Trans. Inf. Theory 62(8): 4376-4394 (2016) - [j5]Silas L. Fong, Vincent Y. F. Tan:
Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach. IEEE Trans. Inf. Theory 62(9): 4953-4967 (2016) - [j4]Silas L. Fong:
Cut-Set Bounds for Multimessage Multicast Networks With Independent Channels and Zero-Delay Edges. IEEE Trans. Inf. Theory 62(11): 6379-6392 (2016) - [c15]Silas L. Fong, Vincent Y. F. Tan:
A proof of the strong converse theorem for Gaussian broadcast channels via the Gaussian Poincaré inequality. ISIT 2016: 170-174 - [c14]Silas L. Fong, Vincent Y. F. Tan, Jing Yang:
A non-asymptotic achievable rate for the AWGN energy-harvesting channel using save-and-transmit. ISIT 2016: 455-459 - [c13]Lan V. Truong, Silas L. Fong, Vincent Y. F. Tan:
On second-order asymptotics of AWGN channels with feedback under the expected power constraint. ISIT 2016: 2419-2423 - [i14]Silas L. Fong, Vincent Y. F. Tan:
On the Scaling Exponent of Polar Codes for Binary-Input Energy-Harvesting Channels. CoRR abs/1601.01089 (2016) - [i13]Silas L. Fong, Vincent Y. F. Tan:
Achievable Rates for Gaussian Degraded Relay Channels with Non-Vanishing Error Probabilities. CoRR abs/1604.01566 (2016) - [i12]Silas L. Fong, Vincent Y. F. Tan:
Strong Converse for Discrete Memoryless Networks with Tight Cut-Set Bounds. CoRR abs/1606.04678 (2016) - 2015
- [j3]Silas L. Fong, Raymond W. Yeung:
Cut-Set Bounds for Networks With Zero-Delay Nodes. IEEE Trans. Inf. Theory 61(7): 3837-3850 (2015) - [j2]Ibrahim Issa, Silas L. Fong, Amir Salman Avestimehr:
Two-Hop Interference Channels: Impact of Linear Schemes. IEEE Trans. Inf. Theory 61(10): 5463-5489 (2015) - [c12]Silas L. Fong, Vincent Y. F. Tan:
Asymptotic expansions for the AWGN channel with feedback under a peak power constraint. ISIT 2015: 311-315 - [c11]Silas L. Fong, Vincent Y. F. Tan:
Strong converse theorems for classes of multimessage multicast networks: A Rényi divergence approach. ISIT 2015: 2545-2549 - [c10]Silas L. Fong:
Cut-set bound for multimessage multicast networks with independent channels and zero-delay edges. ISIT 2015: 2857-2861 - [c9]Silas L. Fong, Vincent Y. F. Tan:
A proof of the strong converse theorem for Gaussian multiple access channels. ITW Fall 2015: 167-171 - [i11]Silas L. Fong, Vincent Y. F. Tan:
A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels. CoRR abs/1502.03204 (2015) - [i10]Silas L. Fong:
Cut-Set Bounds for Multimessage Multicast Networks with Independent Channels and Zero-Delay Edges. CoRR abs/1506.00490 (2015) - [i9]Silas L. Fong, Vincent Y. F. Tan, Jing Yang:
Non-Asymptotic Achievable Rates for Energy-Harvesting Channels using Save-and-Transmit. CoRR abs/1507.02444 (2015) - [i8]Silas L. Fong, Vincent Y. F. Tan:
A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality. CoRR abs/1509.01380 (2015) - [i7]Lan V. Truong, Silas L. Fong, Vincent Y. F. Tan:
On Gaussian Channels with Feedback under Expected Power Constraints and with Non-Vanishing Error Probabilities. CoRR abs/1512.05088 (2015) - 2014
- [c8]Silas L. Fong:
Cut-set bound for generalized networks with deterministic channels. ISITA 2014: 541-545 - [i6]Silas L. Fong, Vincent Y. F. Tan:
Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach. CoRR abs/1407.2417 (2014) - [i5]Silas L. Fong, Vincent Y. F. Tan:
Asymptotic Expansions for Gaussian Channels with Feedback under a Peak Power Constraint. CoRR abs/1410.2390 (2014) - [i4]Silas L. Fong:
Classes of Delay-Independent Multimessage Multicast Networks under the Generalized Model. CoRR abs/1410.5343 (2014) - 2013
- [c7]Ibrahim Issa, Silas L. Fong, Amir Salman Avestimehr:
Two-hop interference channels: Impact of linear time-varying schemes. ISIT 2013: 2309-2313 - [i3]Ibrahim Issa, Silas L. Fong, Amir Salman Avestimehr:
Two-Hop Interference Channels: Impact of Linear Time-Varying Schemes. CoRR abs/1305.3969 (2013) - [i2]Ibrahim Issa, Silas L. Fong, Amir Salman Avestimehr:
Two-Hop Interference Channels: Impact of Linear Schemes. CoRR abs/1309.0898 (2013) - [i1]Silas L. Fong, Raymond W. Yeung:
Cut-Set Bounds for Generalized Networks. CoRR abs/1312.1918 (2013) - 2012
- [c6]Silas L. Fong, Raymond W. Yeung, Gerhard Kramer:
Cut-set bound for generalized networks. ISIT 2012: 1034-1038 - [c5]Silas L. Fong, Raymond W. Yeung:
Cut-set bound for generalized networks with positive delay. ISIT 2012: 1039-1043 - [c4]Silas L. Fong, Li Ping, Chi Wan Sung:
Amplify-and-modulo for Gaussian two-way relay channel. PIMRC 2012: 83-88 - 2011
- [b1]Lik Hang Silas Fong:
On the benefit of network coding in wireless relay networks. Chinese University of Hong Kong, Hong Kong, 2011 - [c3]Silas L. Fong, Mingxi Fan, Raymond W. Yeung:
Practical network coding on three-node point-to-point relay networks. ISIT 2011: 2055-2059 - [c2]Silas L. Fong, Raymond W. Yeung:
Feedback enlarges capacity region of two-way relay channel. ISIT 2011: 2248-2252 - [c1]Silas L. Fong, Raymond W. Yeung:
Capacity bounds for full-duplex two-way relay channel with feedback. ITA 2011: 486-495 - 2010
- [j1]Silas L. Fong, Raymond W. Yeung:
Variable-rate linear network coding. IEEE Trans. Inf. Theory 56(6): 2618-2625 (2010)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
