default search action
Qi Cao 0003
Person information
- affiliation: Chinese University of Hong Kong, Department of Information Engineering, Institute of Network Coding, Hong Kong
- affiliation: Xidian University, State Key Lab of ISN, Xi'an, China
Other persons with the same name
- Qi Cao — disambiguation page
- Qi Cao 0001
— Chinese University of Hong Kong-Shenzhen (CUHK-SZ), Shenzhen, China (and 1 more)
- Qi Cao 0002
- Qi Cao 0004
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Pengfei Shen
Dynamic gNodeB Sleep Control for Energy-Conserving Radio Access Network. IEEE Trans. Cogn. Commun. Netw. 10(4): 1371-1385 (2024) - [j5]Qi Cao
Zero-Error Capacity of the Chemical Residual Channel. IEEE Trans. Inf. Theory 70(2): 854-864 (2024) - [j4]Yulin Shao
A Theory of Semantic Communication. IEEE Trans. Mob. Comput. 23(12): 12211-12228 (2024) - [i5]Qi Cao, Yulin Shao, Fan Yang:
A Hypergraph Approach to Distributed Broadcast. CoRR abs/2404.16376 (2024) - [i4]Qi Cao, Qi Chen, Baoming Bai:
On Zero-Error Capacity of Graphs with One Edge. CoRR abs/2406.17223 (2024) - 2023
- [c9]Qi Cao, Fei Wan, Yameng Du, Baoming Bai:
Semantic Knowledge Base Synchronization by Limited Feedback Assistance. SPAWC 2023: 106-110 - [c8]Hoover H. F. Yin
Multichannel One-Time Length Encoding: Exploiting Channel Redundancy. VCC 2023: 218-223 - 2022
- [j3]Yulin Shao
Partially Observable Minimum-Age Scheduling: The Greedy Policy. IEEE Trans. Commun. 70(1): 404-418 (2022) - [j2]Qi Cao
Zero-Error Capacity Regions of Noisy Networks. IEEE Trans. Inf. Theory 68(7): 4201-4223 (2022) - [c7]Qi Cao, Qi Chen:
On Zero-Error Capacity of "One-Edge" Binary Channels with Two Memories. ISIT 2022: 2762-2767 - [c6]Qi Cao, Qiaoqiao Zhou:
On the Zero-Error Capacity of the Chemical Residual Channel. ITW 2022: 291-296 - [i3]Pengfei Shen, Yulin Shao, Qi Cao, Lu Lu:
Dynamic gNodeB Sleep Control for Energy-Conserving 5G Radio Access Network. CoRR abs/2207.06309 (2022) - [i2]Yulin Shao, Qi Cao, Deniz Gündüz:
A Theory of Semantic Communication. CoRR abs/2212.01485 (2022) - 2020
- [c5]Hoover H. F. Yin
On the Memory Requirements of Block Interleaver for Batched Network Codes. ISIT 2020: 1652-1657 - [i1]Yulin Shao, Qi Cao, Soung Chang Liew:
Partially Observable Minimum-Age Scheduling: The Greedy Policy. CoRR abs/2009.13441 (2020)
2010 – 2019
- 2019
- [c4]Rosanna Yuen-Yan Chan
What Does Information Mean to Me as an Engineer? Fostering Engineering Students' Holistic Competencies in the Informational World. FIE 2019: 1-5 - [c3]Hoover H. F. Yin
On the Minimum Delay of Block Interleaver for Batched Network Codes. ISIT 2019: 1957-1961 - 2018
- [j1]Qi Cao
On Zero-Error Capacity of Binary Channels With One Memory. IEEE Trans. Inf. Theory 64(10): 6771-6778 (2018) - 2017
- [c2]Rosanna Yuen-Yan Chan
Direct evidence of engineering students' generic skills learning: From research to practice in an undergraduate course in information engineering. FIE 2017: 1-5 - 2015
- [c1]Qi Cao, Ning Cai, Wangmei Guo:
Zero-error capacity of binary channels with 1-memory. ISIT 2015: 1317-1321
Coauthor Index
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-12-23 19:35 CET 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: