default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKai Cai 0001
Person information
- affiliation: University of Hong Kong, Pokfulam, Hong Kong, SAR, China
Other persons with the same name
- Kai Cai — disambiguation page
- Kai Cai 0002
![[0000-0002-8784-0728]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-8784-0728")
— Osaka Metropolitan University, Osaka, Japan - Kai Cai 0003 — Hebei University of Engineering, Handan, Hebei, China
- Kai Cai 0004 — Huazhong University of Science and Technology, Wuhan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2024
[c11]Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture for Networks with Collapsed Backbone. ISIT 2024: 1309-1314- 2023
- [j11]Kai Cai, Guangyue Han:
An optimization approach to the Langberg-Médard multiple unicast conjecture. Adv. Math. Commun. 17(2): 431-445 (2023) - 2022
- [j10]Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks. IEEE Trans. Inf. Theory 68(6): 3879-3895 (2022) - 2020
- [c10]Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks. ISIT 2020: 1617-1622 - [i8]Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks. CoRR abs/2001.02017 (2020)
2010 – 2019
- 2018
- [j9]Wentu Song, Kai Cai, Chau Yuen, Kui Cai, Guangyue Han:
On Sequential Locally Repairable Codes. IEEE Trans. Inf. Theory 64(5): 3513-3527 (2018) - [c9]Kai Cai, Guangyue Han:
On the Langberg-Médard k-Unicast Conjecture with $k=3, 4$. ISIT 2018: 246-250 - [i7]Kai Cai, Guangyue Han:
An Optimization Approach to the Langberg-Médard Multiple Unicast Conjecture. CoRR abs/1806.03408 (2018) - 2017
- [j8]Kai Cai, Guangyue Han:
On the Langberg-Médard multiple unicast conjecture. J. Comb. Optim. 34(4): 1114-1132 (2017) - 2016
- [c8]Kai Cai, Guangyue Han:
Coding advantage in communications among peers. ISIT 2016: 2309-2313 - [i6]Wentu Song, Kai Cai, Chau Yuen:
On Sequential Locally Repairable Codes. CoRR abs/1610.09767 (2016) - 2015
- [c7]Kai Cai, Guangyue Han:
On network coding advantage for multiple unicast networks. ISIT 2015: 366-370 - [i5]Wentu Song, Kai Cai, Chau Yuen, Rongquan Feng:
On the Solvability of 3s/nt Sum-Network - A Region Decomposition and Weak Decentralized Code Method. CoRR abs/1502.00762 (2015) - 2014
- [c6]Kai Cai, Guangyue Han:
On the solvability of three-pair networks with common bottleneck links. ITW 2014: 546-550 - [i4]Wentu Song, Chau Yuen, Kai Cai, Rongquan Feng:
Network Coding for $3$s$/n$t Sum-Networks. CoRR abs/1401.3941 (2014) - 2013
- [j7]Kai Cai, Khaled Ben Letaief, Pingyi Fan, Rongquan Feng:
On the solvability of single rate 2-pair networks - A cut-based characterization. Phys. Commun. 6: 124-133 (2013) - [j6]Wentu Song, Kai Cai, Rongquan Feng, Chau Yuen:
The Complexity of Network Coding With Two Unit-Rate Multicast Sessions. IEEE Trans. Inf. Theory 59(9): 5692-5707 (2013) - 2012
- [c5]Kai Cai, Junshan Zhang:
On critical thresholds for influence spreading. CISS 2012: 1-6 - [c4]Wentu Song, Kai Cai, Rongquan Feng:
The encoding complexity of network coding with two simple multicast sessions. FSKD 2012: 2253-2257 - [c3]Wentu Song, Rongquan Feng, Kai Cai, Junshan Zhang:
Network coding for two-unicast with rate (1, 2). ISIT 2012: 1912-1916 - 2010
- [i3]Kai Cai, Khaled Ben Letaief, Pingyi Fan, Rongquan Feng:
On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization. CoRR abs/1007.0465 (2010) - [i2]Wentu Song, Kai Cai, Rongquan Feng, Rui Wang:
Encoding Complexity for Intersession Network Coding with Two Simple Multicast Sessions. CoRR abs/1007.2928 (2010)
2000 – 2009
- 2009
- [j5]Jingyao Zhang, Khaled Ben Letaief, Pingyi Fan, Kai Cai:
Network-Coding-Based Signal Recovery for Efficient Scheduling in Wireless Networks. IEEE Trans. Veh. Technol. 58(3): 1572-1582 (2009) - [i1]Kai Cai, Rongquan Feng, Zhiming Zheng:
Cross-correlation properties of cyclotomic sequences. CoRR abs/0909.4589 (2009) - 2007
- [j4]Kai Cai, Rongquan Feng, Zhiming Zheng:
Cross-Correlation Properties of Cyclotomic Sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 281-286 (2007) - [j3]Kai Cai, Pingyi Fan:
An Algebraic Approach to Link Failures Based on Network Coding. IEEE Trans. Inf. Theory 53(2): 775-779 (2007) - [j2]Pingyi Fan, Guansheng Li, Kai Cai, Khaled Ben Letaief:
On the Geometrical Characteristic of Wireless Ad-Hoc Networks and its Application in Network Performance Analysis. IEEE Trans. Wirel. Commun. 6(4): 1256-1265 (2007) - [c2]Jingyao Zhang, Kai Cai, Khaled Ben Letaief, Pingyi Fan:
A Network Coding Unicast Strategy for Wireless Multi-Hop Networks. WCNC 2007: 4221-4226 - 2006
- [j1]Guansheng Li, Pingyi Fan, Kai Cai:
On the Geometrical Characteristics of Three-Dimensional Wireless Ad Hoc Networks and Their Applications. EURASIP J. Wirel. Commun. Netw. 2006 (2006) - [c1]Jingtao Yu, Pingyi Fan, Kai Cai:
Capacity analysis of maximal flow in ad hoc networks. IWCMC 2006: 1225-1228
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 2026-07-07 01:13 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
