Wei Kang

Orcid: 0000-0003-4408-6419

Affiliations:
  • Southeast University, School of Information Science and Engineering, Nanjing, China
  • University of Maryland, College Park, Maryland, USA (PhD 2008)
  • McGill University, Montreal, Quebec, Canada (former)
  • Beijing University of Posts and Telecommunications, Beijing, China (former)


According to our database1, Wei Kang authored at least 58 papers between 2005 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
Optimizing Distributions for Associated Entropic Vectors via Generative Convolutional Neural Networks.
Entropy, August, 2024

Minimizing Computation and Communication Costs of Two-Sided Secure Distributed Matrix Multiplication under Arbitrary Collusion Pattern.
Entropy, May, 2024

Fundamental Limits of Coded Caching in Request-Robust D2D Communication Networks.
Entropy, March, 2024

2023
Three-User D2D Coded Caching With Two Random Requesters and One Sender.
IEEE Trans. Commun., December, 2023

A Numerical Study on the Capacity Region of a Three-Layer Wiretap Network.
Entropy, December, 2023

On the Asymptotic Capacity of Information-Theoretic Privacy-Preserving Epidemiological Data Collection.
Entropy, April, 2023

Secure Distributed Matrix Multiplication Under Arbitrary Collusion Pattern.
IEEE Trans. Inf. Forensics Secur., 2023

Multiple Threshold Schemes Under The Weak Secure Condition.
CoRR, 2023

A Cyclic Placement Strategy for Multi-access Coded Caching.
CoRR, 2023

The Capacity Region of Distributed Multi-User Secret Sharing under The Perfect Privacy Condition.
CoRR, 2023

The Closure of the Entropy Region is Not Closed Under Polymatroid Duality for Four Discrete Random Variables.
Proceedings of the International Symposium on Networks, Computers and Communications, 2023

Coded Caching in Request-robust D2D Communication Networks.
Proceedings of the International Symposium on Networks, Computers and Communications, 2023

The Capacity of Oblivious Transfer with Replicated Databases and Binary Erasure Multiple Access Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Capacity Results of Coded Caching: The Pareto Optimal Frontier of the Two-User Case.
Proceedings of the 2023 4th International Conference on Computing, 2023

2022
The Capacity of Symmetric Private Information Retrieval Under Arbitrary Collusion and Eavesdropping Patterns.
IEEE Trans. Inf. Forensics Secur., 2022

On the Asymptotic Capacity of Information Theoretical Privacy-preserving Epidemiological Data Collection.
CoRR, 2022

On the Rate-Memory Tradeoff of D2D Coded Caching with Three Users.
CoRR, 2022

Capacity Results for the Wiretapped Oblivious Transfer.
CoRR, 2022

All Integral Points Satisfying Linear Rank Inequalities on Four or Less Variables are Representable.
Proceedings of the 14th International Conference on Wireless Communications and Signal Processing, 2022

2021
The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns for Replicated Databases.
IEEE Trans. Inf. Theory, 2021

2020
The Capacity of Symmetric Private Information Retrieval under Arbitrary Collusion and Eavesdropping Patterns.
CoRR, 2020

The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Cache-Aided Multi-message Private Information Retrieval.
Proceedings of the Communications and Networking, 2020

2019
Converse Results for the Downlink Multicell Processing With Finite Backhaul Capacity.
IEEE Trans. Inf. Theory, 2019

Coded Caching With Asymmetric Cache Sizes and Link Qualities: The Two-User Case.
IEEE Trans. Commun., 2019

The Capacity of Multi-round Private Information Retrieval from Byzantine Databases.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
An Upper bound on the Error Exponent in Lossless Source Coding with a Helper.
Proceedings of the IEEE Information Theory Workshop, 2018

Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
The Capacity of a Class of Channels With Coded Side Information at the Decoder.
IEEE Trans. Inf. Theory, 2017

Secret key generation from correlated sources and secure link.
Proceedings of the 9th International Conference on Wireless Communications and Signal Processing, 2017

An upper bound on the sum capacity of the downlink multicell processing with finite backhaul capacity.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Compressing Encrypted Data: Achieving Optimality and Strong Secrecy via Permutations.
IEEE Trans. Inf. Theory, 2016

2015
The Gaussian Multiple Access Diamond Channel.
IEEE Trans. Inf. Theory, 2015

Deception With Side Information in Biometric Authentication Systems.
IEEE Trans. Inf. Theory, 2015

The multiple access diamond channel with caching relays.
Proceedings of the IEEE International Symposium on Information Theory, 2015

A permutation-based code for the wiretap channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Message authentication with correlated sources.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
The Capacity Region of a Class of Z Channels With Degraded Message Sets.
IEEE Trans. Inf. Theory, 2014

Compressing Encrypted Data and Permutation Cipher.
CoRR, 2014

A new achievability scheme for downlink multicell processing with finite backhaul capacity.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Authentication with side information.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
A new outer bound on the capacity region of a class of Z-interference channels.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

The Ahlswede-Han conjecture on channel with coded side information at the decoder.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Joint decode-compress-forward for the broadcast diamond channel.
Proceedings of the 2012 1st IEEE International Conference on Communications in China (ICCC), 2012

Capacity results for a class of Z channels with degraded message sets.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

Compressing encrypted data: A permutation approach.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Capacity of a Class of Diamond Channels.
IEEE Trans. Inf. Theory, 2011

A New Data Processing Inequality and Its Applications in Distributed Source and Channel Coding.
IEEE Trans. Inf. Theory, 2011

The secrecy capacity region of a special class of multiple access channels.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

The Gaussian multiple access diamond channel.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Capacity results for a class of deterministic Z-interference channels with unidirectional receiver conferencing.
Proceedings of the 6th International ICST Conference on Communications and Networking in China, 2011

2010
Wiretap channel with shared key.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
The secrecy capacity of the semi-deterministic broadcast channel.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Correlation and cooperation in network information theory.
PhD thesis, 2008

2007
A New Achievability Scheme for the Relay Channel
CoRR, 2007

2006
An Outer Bound for the Multi-Terminal Rate-Distortion Region.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

An Outer Bound for Multiple Access Channels with Correlated Sources.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005
A Single-letter Upper Bound for the Sum Rate of Multiple Access Channels with Correlated Sources
CoRR, 2005


  Loading...