Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWei Kang 0002
Person information
- affiliation: Southeast University, School of Information Science and Engineering, Nanjing, China
- affiliation (PhD 2008): University of Maryland, College Park, Maryland, USA
- affiliation (former): McGill University, Montreal, Quebec, Canada
- affiliation (former): Beijing University of Posts and Telecommunications, Beijing, China
Other persons with the same name
- Wei Kang — disambiguation page
- Wei Kang 0001
![[0000-0002-1194-722X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1194-722X")
— Naval Postgraduate School, Department of Applied Mathematics, Monterey, CA, USA - Wei Kang 0003 — Fuyang Normal University, School of Information Engineering, China (and 1 more)
- Wei Kang 0004 — University of South Australia, School of Information Technology and Mathematical Sciences, Adelaide, Australia (and 1 more)
- Wei Kang 0005 — University of California Riverside, Center for Geospatial Sciences, CA, USA (and 1 more)
- Wei Kang 0006 — Xiaomi Corp., Beijing, China
- Wei Kang 0007 — Peking University, Institute of Computational Linguistics, Key Laboratory of Computational Linguistics, Beijing, China
- Wei Kang 0008 — Iwate Prefectural University, Graduate School of Software and Information Science, Japan
- Wei Kang 0009 — New South Wales, Data61, CSIRO, Eveleigh, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Wuqu Wang, Zhe Tao, Nan Liu, Wei Kang:
Fundamental Limits of Coded Caching in Request-Robust D2D Communication Networks. Entropy 26(3): 250 (2024)- 2023
- [j15]Jiale Cheng, Nan Liu, Wei Kang:
On the Asymptotic Capacity of Information-Theoretic Privacy-Preserving Epidemiological Data Collection. Entropy 25(4): 625 (2023) - [j14]Jiahong Wu, Nan Liu, Wei Kang:
A Numerical Study on the Capacity Region of a Three-Layer Wiretap Network. Entropy 25(12): 1566 (2023) - [j13]Wuqu Wang, Nan Liu, Wei Kang:
Three-User D2D Coded Caching With Two Random Requesters and One Sender. IEEE Trans. Commun. 71(12): 6967-6978 (2023) - [j12]Yucheng Yao, Nan Liu, Wei Kang, Chunguo Li:
Secure Distributed Matrix Multiplication Under Arbitrary Collusion Pattern. IEEE Trans. Inf. Forensics Secur. 18: 85-100 (2023) - [c30]Zhiqiang Luo, Nan Liu, Wei Kang:
Capacity Results of Coded Caching: The Pareto Optimal Frontier of the Two-User Case. CNIOT 2023: 975-982 - [c29]Tianyou Pei, Wei Kang, Nan Liu:
The Capacity of Oblivious Transfer with Replicated Databases and Binary Erasure Multiple Access Channel. ISIT 2023: 1592-1596 - [c28]Wuqu Wang, Nan Liu, Wei Kang:
Coded Caching in Request-robust D2D Communication Networks. ISNCC 2023: 1-6 - [c27]Jiahong Wu, Nan Liu, Wei Kang:
The Closure of the Entropy Region is Not Closed Under Polymatroid Duality for Four Discrete Random Variables. ISNCC 2023: 1-4 - [i20]Jiahong Wu, Nan Liu, Wei Kang:
The Capacity Region of Distributed Multi-User Secret Sharing under The Perfect Privacy Condition. CoRR abs/2302.03920 (2023) - [i19]Zeru Chen, Nan Liu, Wei Kang:
A Cyclic Placement Strategy for Multi-access Coded Caching. CoRR abs/2312.04922 (2023) - [i18]Jiahong Wu, Nan Liu, Wei Kang:
Multiple Threshold Schemes Under The Weak Secure Condition. CoRR abs/2312.05737 (2023) - 2022
- [j11]Jiale Cheng, Nan Liu, Wei Kang, Yang Li:
The Capacity of Symmetric Private Information Retrieval Under Arbitrary Collusion and Eavesdropping Patterns. IEEE Trans. Inf. Forensics Secur. 17: 3037-3050 (2022) - [c26]Jiahong Wu, Nan Liu, Wei Kang:
All Integral Points Satisfying Linear Rank Inequalities on Four or Less Variables are Representable. WCSP 2022: 383-387 - [i17]Tianyou Pei, Wei Kang, Nan Liu:
Capacity Results for the Wiretapped Oblivious Transfer. CoRR abs/2207.06363 (2022) - [i16]Wuqu Wang, Nan Liu, Wei Kang:
On the Rate-Memory Tradeoff of D2D Coded Caching with Three Users. CoRR abs/2209.10225 (2022) - [i15]Jiale Cheng, Nan Liu, Wei Kang:
On the Asymptotic Capacity of Information Theoretical Privacy-preserving Epidemiological Data Collection. CoRR abs/2212.05914 (2022) - 2021
- [j10]Xinyu Yao, Nan Liu, Wei Kang:
The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns for Replicated Databases. IEEE Trans. Inf. Theory 67(10): 6841-6855 (2021) - 2020
- [c25]Yang Li, Nan Liu, Wei Kang:
Cache-Aided Multi-message Private Information Retrieval. ChinaCom 2020: 127-141 - [c24]Xinyu Yao, Nan Liu, Wei Kang:
The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns. ISIT 2020: 1041-1046 - [i14]Xinyu Yao, Nan Liu, Wei Kang:
The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns. CoRR abs/2001.03843 (2020) - [i13]Jiale Cheng, Nan Liu, Wei Kang:
The Capacity of Symmetric Private Information Retrieval under Arbitrary Collusion and Eavesdropping Patterns. CoRR abs/2010.08249 (2020)
2010 – 2019
- 2019
- [j9]Daming Cao, Deyao Zhang, Pengyao Chen, Nan Liu, Wei Kang, Deniz Gündüz:
Coded Caching With Asymmetric Cache Sizes and Link Qualities: The Two-User Case. IEEE Trans. Commun. 67(9): 6112-6126 (2019) - [j8]Tianyu Yang, Nan Liu, Wei Kang, Shlomo Shamai Shitz:
Converse Results for the Downlink Multicell Processing With Finite Backhaul Capacity. IEEE Trans. Inf. Theory 65(1): 368-379 (2019) - [c23]Xinyu Yao, Nan Liu, Wei Kang:
The Capacity of Multi-round Private Information Retrieval from Byzantine Databases. ISIT 2019: 2124-2128 - [i12]Xinyu Yao, Nan Liu, Wei Kang:
The Capacity of Multi-round Private Information Retrieval from Byzantine Databases. CoRR abs/1901.06907 (2019) - 2018
- [c22]Daming Cao, Deyao Zhang, Pengyao Chen, Nan Liu, Wei Kang, Deniz Gündüz:
Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case. ISIT 2018: 1545-1549 - [c21]Wei Kang, Nan Liu:
An Upper bound on the Error Exponent in Lossless Source Coding with a Helper. ITW 2018: 1-5 - [i11]Daming Cao, Deyao Zhang, Pengyao Chen, Nan Liu, Wei Kang, Deniz Gündüz:
Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case. CoRR abs/1802.02706 (2018) - 2017
- [j7]Nan Liu, Wei Kang:
The Capacity of a Class of Channels With Coded Side Information at the Decoder. IEEE Trans. Inf. Theory 63(1): 72-80 (2017) - [c20]Tianyu Yang, Nan Liu, Wei Kang, Shlomo Shamai Shitz:
An upper bound on the sum capacity of the downlink multicell processing with finite backhaul capacity. ISIT 2017: 2053-2057 - [c19]Daming Cao, Wei Kang:
Secret key generation from correlated sources and secure link. WCSP 2017: 1-5 - [i10]Daming Cao, Wei Kang:
Secret Key Generation from Correlated Sources and Secure Link. CoRR abs/1704.05220 (2017) - 2016
- [j6]Wei Kang, Nan Liu:
Compressing Encrypted Data: Achieving Optimality and Strong Secrecy via Permutations. IEEE Trans. Inf. Theory 62(12): 7153-7163 (2016) - [i9]Tianyu Yang, Nan Liu, Wei Kang, Shlomo Shamai:
An Upper Bound on the Sum Capacity of the Downlink Multicell Processing with Finite Backhaul Capacity. CoRR abs/1609.00833 (2016) - 2015
- [j5]Wei Kang, Daming Cao, Nan Liu:
Deception With Side Information in Biometric Authentication Systems. IEEE Trans. Inf. Theory 61(3): 1344-1350 (2015) - [j4]Wei Kang, Nan Liu, Weiwei Chong:
The Gaussian Multiple Access Diamond Channel. IEEE Trans. Inf. Theory 61(11): 6049-6059 (2015) - [c18]Wei Kang, Nan Liu:
A permutation-based code for the wiretap channel. ISIT 2015: 2306-2310 - [c17]Nan Liu, Wei Kang:
The multiple access diamond channel with caching relays. ISIT 2015: 2862-2866 - [c16]Daming Cao, Wei Kang:
Message authentication with correlated sources. ISIT 2015: 2934-2938 - 2014
- [j3]Nan Liu, Wei Kang:
The Capacity Region of a Class of Z Channels With Degraded Message Sets. IEEE Trans. Inf. Theory 60(10): 6144-6153 (2014) - [c15]Nan Liu, Wei Kang:
A new achievability scheme for downlink multicell processing with finite backhaul capacity. ISIT 2014: 1006-1010 - [c14]Wei Kang, Daming Cao, Nan Liu:
Authentication with side information. ISIT 2014: 1722-1726 - [i8]Wei Kang, Daming Cao, Nan Liu:
Deception with Side Information in Biometric Authentication Systems. CoRR abs/1406.3103 (2014) - [i7]Wei Kang, Nan Liu:
Compressing Encrypted Data and Permutation Cipher. CoRR abs/1408.5666 (2014) - 2013
- [c13]Nan Liu, Wei Kang:
A new outer bound on the capacity region of a class of Z-interference channels. ISIT 2013: 2049-2053 - [c12]Wei Kang, Nan Liu:
The Ahlswede-Han conjecture on channel with coded side information at the decoder. ISIT 2013: 3075-3079 - 2012
- [c11]Nan Liu, Wei Kang:
Capacity results for a class of Z channels with degraded message sets. Allerton Conference 2012: 1225-1231 - [c10]Wei Kang, Nan Liu:
Compressing encrypted data: A permutation approach. Allerton Conference 2012: 1382-1386 - [c9]Weiwei Chong, Wei Kang:
Joint decode-compress-forward for the broadcast diamond channel. ICCC 2012: 191-196 - 2011
- [j2]Wei Kang, Sennur Ulukus:
A New Data Processing Inequality and Its Applications in Distributed Source and Channel Coding. IEEE Trans. Inf. Theory 57(1): 56-69 (2011) - [j1]Wei Kang, Sennur Ulukus:
Capacity of a Class of Diamond Channels. IEEE Trans. Inf. Theory 57(8): 4955-4960 (2011) - [c8]Nan Liu, Deniz Gündüz, Wei Kang:
Capacity results for a class of deterministic Z-interference channels with unidirectional receiver conferencing. CHINACOM 2011: 580-584 - [c7]Nan Liu, Wei Kang:
The secrecy capacity region of a special class of multiple access channels. ISIT 2011: 623-627 - [c6]Wei Kang, Nan Liu:
The Gaussian multiple access diamond channel. ISIT 2011: 1499-1503 - [i6]Wei Kang, Nan Liu:
The Gaussian Multiple Access Diamond Channel. CoRR abs/1104.3300 (2011) - 2010
- [c5]Wei Kang, Nan Liu:
Wiretap channel with shared key. ITW 2010: 1-5
2000 – 2009
- 2009
- [c4]Wei Kang, Nan Liu:
The secrecy capacity of the semi-deterministic broadcast channel. ISIT 2009: 2767-2771 - 2008
- [b1]Wei Kang:
Correlation and cooperation in network information theory. University of Maryland, College Park, MD, USA, 2008 - [c3]Wei Kang, Sennur Ulukus:
Capacity of a class of diamond channels. Allerton 2008: 1426-1431 - [i5]Wei Kang, Sennur Ulukus:
Capacity of a Class of Diamond Channels. CoRR abs/0808.0948 (2008) - 2007
- [i4]Wei Kang, Sennur Ulukus:
A New Achievability Scheme for the Relay Channel. CoRR abs/0710.0900 (2007) - 2006
- [c2]Wei Kang, Sennur Ulukus:
An Outer Bound for Multiple Access Channels with Correlated Sources. CISS 2006: 240-244 - [c1]Wei Kang, Sennur Ulukus:
An Outer Bound for the Multi-Terminal Rate-Distortion Region. ISIT 2006: 1419-1423 - [i3]Wei Kang, Sennur Ulukus:
An Outer Bound for the Multi-Terminal Rate-Distortion Region. CoRR abs/cs/0605129 (2006) - [i2]Wei Kang, Sennur Ulukus:
A New Data Processing Inequality and Its Applications in Distributed Source and Channel Coding. CoRR abs/cs/0611017 (2006) - 2005
- [i1]Wei Kang, Sennur Ulukus:
A Single-letter Upper Bound for the Sum Rate of Multiple Access Channels with Correlated Sources. CoRR abs/cs/0511096 (2005)
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-05-20 02:16 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:
