Kai Cai

Orcid: 0000-0002-8798-8650

Affiliations:
  • University of Hong Kong, Pokfulam, Hong Kong, SAR, China


According to our database1, Kai Cai authored at least 27 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Langberg-Médard Multiple Unicast Conjecture for Networks with Collapsed Backbone.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
An optimization approach to the Langberg-Médard multiple unicast conjecture.
Adv. Math. Commun., 2023

2022
The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks.
IEEE Trans. Inf. Theory, 2022

2020
The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2018
On Sequential Locally Repairable Codes.
IEEE Trans. Inf. Theory, 2018

On the Langberg-Médard k-Unicast Conjecture with $k=3, 4$.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
On the Langberg-Médard multiple unicast conjecture.
J. Comb. Optim., 2017

2016
On Sequential Locally Repairable Codes.
CoRR, 2016

Coding advantage in communications among peers.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
On the Solvability of 3s/nt Sum-Network - A Region Decomposition and Weak Decentralized Code Method.
CoRR, 2015

On network coding advantage for multiple unicast networks.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Network Coding for $3$s$/n$t Sum-Networks.
CoRR, 2014

On the solvability of three-pair networks with common bottleneck links.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

2013
The Complexity of Network Coding With Two Unit-Rate Multicast Sessions.
IEEE Trans. Inf. Theory, 2013

On the solvability of single rate 2-pair networks - A cut-based characterization.
Phys. Commun., 2013

2012
Network coding for two-unicast with rate (1, 2).
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

The encoding complexity of network coding with two simple multicast sessions.
Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

On critical thresholds for influence spreading.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

2010
Encoding Complexity for Intersession Network Coding with Two Simple Multicast Sessions
CoRR, 2010

On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization
CoRR, 2010

2009
Network-Coding-Based Signal Recovery for Efficient Scheduling in Wireless Networks.
IEEE Trans. Veh. Technol., 2009

2007
On the Geometrical Characteristic of Wireless Ad-Hoc Networks and its Application in Network Performance Analysis.
IEEE Trans. Wirel. Commun., 2007

An Algebraic Approach to Link Failures Based on Network Coding.
IEEE Trans. Inf. Theory, 2007

Cross-Correlation Properties of Cyclotomic Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

A Network Coding Unicast Strategy for Wireless Multi-Hop Networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2007

2006
On the Geometrical Characteristics of Three-Dimensional Wireless Ad Hoc Networks and Their Applications.
EURASIP J. Wirel. Commun. Netw., 2006

Capacity analysis of maximal flow in ad hoc networks.
Proceedings of the International Conference on Wireless Communications and Mobile Computing, 2006


  Loading...