default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChih-Chun Wang
- > Home > Persons > Chih-Chun Wang
Publications
- 2024
[j44]Eric Ruzomberka
, Chih-Chun Wang, David J. Love:
Channel Capacity for Adversaries With Computationally Bounded Observations. IEEE Trans. Inf. Theory 70(1): 75-92 (2024)- 2023
- [j42]Eric Ruzomberka, David J. Love, Christopher G. Brinton, Arpit Gupta, Chih-Chun Wang, H. Vincent Poor:
Challenges and Opportunities for Beyond-5G Wireless Security. IEEE Secur. Priv. 21(5): 55-66 (2023) - [j40]Dennis Ogbe, Chih-Chun Wang, David J. Love:
On the Optimal Delay Growth Rate of Multi-Hop Line Networks: Asymptotically Delay-Optimal Designs and the Corresponding Error Exponents. IEEE Trans. Inf. Theory 69(10): 6167-6193 (2023) - [j39]Matthew A. Bliss, Chih-Chun Wang, David J. Love:
Optimal Single-Bit Relaying Strategies With Multi-Relay Diversity. IEEE Trans. Inf. Theory 69(10): 6518-6536 (2023) - [c75]Chih-Chun Wang, David J. Love:
Optimal Learning Rate of Sending One Bit Over Arbitrary Acyclic BISO-Channel Networks. ISIT 2023: 1360-1365 - [i21]Eric Ruzomberka, David J. Love, Christopher G. Brinton, Arpit Gupta, Chih-Chun Wang, H. Vincent Poor:
Challenges and Opportunities for Beyond-5G Wireless Security. CoRR abs/2303.00727 (2023) - 2022
- [j37]Vinayak Suresh, Eric Ruzomberka, Chih-Chun Wang, David J. Love:
Causal Adversarial Channels With Feedback Snooping. IEEE J. Sel. Areas Inf. Theory 3(1): 69-84 (2022) - [c69]Eric Ruzomberka, Chih-Chun Wang, David J. Love:
Channel Capacity for Adversaries with Computationally Bounded Observations. ISIT 2022: 2529-2534 - [i20]Eric Ruzomberka, Chih-Chun Wang, David J. Love:
Channel Capacity for Adversaries with Computationally Bounded Observations. CoRR abs/2202.02905 (2022) - 2020
- [c63]Dennis Ogbe, David J. Love, Chih-Chun Wang:
Backhauling Many Devices: Relay Schemes for Massive Random Access Networks. GLOBECOM 2020: 1-6 - 2019
- [c55]Dennis Ogbe, Chih-Chun Wang, David J. Love:
On the Optimal Delay Amplification Factor of Multi-Hop Relay Channels. ISIT 2019: 2913-2917 - 2017
- [c52]Chih-Chun Wang, David J. Love, Dennis Ogbe:
Transcoding: A new strategy for relay channels. Allerton 2017: 450-454 - 2015
- [j23]Ziad Ahmad, Zachary Chance, David James Love, Chih-Chun Wang:
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels With Noisy Channel Output Feedback. IEEE Trans. Commun. 63(11): 4576-4590 (2015) - 2012
- [c34]Chih-Chun Wang, David J. Love:
Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedback. ISIT 2012: 2062-2066
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-09-10 01:14 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:
