default search action
Hua Sun 0001
Person information
- affiliation: University of North Texas, Department of Electrical Engineering, Denton, TX, USA
- affiliation: University of California at Irvine, Center of Pervasive Communications and Computing, USA
Other persons with the same name
- Hua Sun — disambiguation page
- Hua Sun 0002
— Central South University of Forest and Technology, Research Center of Forestry Remote Sensing and Information Engineering, Changsha, China
- Hua Sun 0003
- Hua Sun 0004
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j49]Ali Gholami
Coded Caching With Private Demands and Caches. IEEE Trans. Inf. Theory 70(2): 1087-1106 (2024) - [j48]Yizhou Zhao
Secure Summation: Capacity Region, Groupwise Key, and Feasibility. IEEE Trans. Inf. Theory 70(2): 1376-1387 (2024) - [j47]Zhou Li
On Extremal Rates of Storage Over Graphs. IEEE Trans. Inf. Theory 70(4): 2464-2478 (2024) - [j46]Kai Wan
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys. IEEE Trans. Inf. Theory 70(9): 6596-6619 (2024) - [j45]Kai Wan
The Capacity Region of Information Theoretic Secure Aggregation With Uncoded Groupwise Keys. IEEE Trans. Inf. Theory 70(10): 6932-6949 (2024) - [c53]Ali Gholami, Kai Wan, Tayyebeh Jahani-Nezhad, Hua Sun, Mingyue Ji, Giuseppe Caire:
On Multi-Message Private Computation. ISIT 2024: 945-950 - [c52]Ziting Zhang, Jiayu Liu, Kai Wan, Hua Sun, J. Mingyue, Giuseppe Caire:
On the Optimality of Secure Aggregation with Uncoded Groupwise Keys Against User Dropouts and User Collusion. ISIT 2024: 2730-2735 - [c51]Kai Wan, Hua Sun, Mingyue Ji, Tiebin Mi, Giuseppe Caire:
Optimal Information Theoretic Secure Aggregation with Uncoded Groupwise Keys. ISIT 2024: 2736-2741 - [i56]Xiang Zhang, Kai Wan, Hua Sun, Shiqiang Wang, Mingyue Ji, Giuseppe Caire:
Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation with User Collusion. CoRR abs/2410.14035 (2024) - 2023
- [j44]Chao Tian
A Shannon-Theoretic Approach to the Storage-Retrieval Trade-Off in PIR Systems. Inf. 14(1): 44 (2023) - [j43]Zhou Li
On the Linear Capacity of Conditional Disclosure of Secrets. IEEE Trans. Commun. 71(12): 7218-7227 (2023) - [j42]Zhou Li
On Extremal Rates of Secure Storage Over Graphs. IEEE Trans. Inf. Forensics Secur. 18: 4721-4731 (2023) - [c50]Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
A Novel Scheme for Cache-Aided Multiuser Private Information Retrieval with User-to-User Privacy. ACSSC 2023: 717-723 - [c49]Ziting Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Secure Aggregation with Uncoded Groupwise Keys Against User Collusion. ICCCS 2023: 559-564 - [c48]Kai Wan, Yin Yao, Hua Sun, Mingyue Ji, Giuseppe Caire:
GroupSecAgg: Information Theoretic Secure Aggregation with Uncoded Groupwise Keys. ICC 2023: 3890-3895 - [c47]Yizhou Zhao, Hua Sun:
The Optimal Rate of MDS Variable Generation. ISIT 2023: 832-837 - [c46]Zhou Li, Hua Sun:
On Extremal Rates of Storage over Graphs. ISIT 2023: 2039-2044 - [c45]Wenbo Huang, Kai Wan, Hua Sun, Mingyue Ji, Robert Caiming Qiu, Giuseppe Caire:
Fundamental Limits of Distributed Linearly Separable Computation under Cyclic Assignment. ISIT 2023: 2296-2301 - [c44]Zhou Li, Yizhou Zhao, Hua Sun:
Weakly Secure Summation with Colluding Users. ISIT 2023: 2398-2403 - [i55]Chao Tian, Hua Sun, Jun Chen:
A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems. CoRR abs/2301.02155 (2023) - [i54]Zhou Li, Yizhou Zhao, Hua Sun:
Weakly Secure Summation with Colluding Users. CoRR abs/2304.09771 (2023) - [i53]Wenbo Huang, Kai Wan, Hua Sun, Mingyue Ji, Robert Caiming Qiu, Giuseppe Caire:
Fundamental Limits of Distributed Linearly Separable Computation under Cyclic Assignment. CoRR abs/2305.05143 (2023) - [i52]Kai Wan, Hua Sun, Mingyue Ji, Tiebin Mi, Giuseppe Caire:
The Capacity Region of Information Theoretic Secure Aggregation with Uncoded Groupwise Keys. CoRR abs/2310.09889 (2023) - 2022
- [j41]Kai Wan
On Secure Distributed Linearly Separable Computation. IEEE J. Sel. Areas Commun. 40(3): 912-926 (2022) - [j40]Ruida Zhou
Two-Level Private Information Retrieval. IEEE J. Sel. Areas Inf. Theory 3(2): 337-349 (2022) - [j39]Hua Sun
Compound Secure Groupcast: Key Assignment for Selected Broadcasting. IEEE J. Sel. Areas Inf. Theory 3(2): 379-389 (2022) - [j38]Zhou Li
Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach. IEEE Trans. Commun. 70(6): 4052-4062 (2022) - [j37]Kai Wan
Distributed Linearly Separable Computation. IEEE Trans. Inf. Theory 68(2): 1259-1278 (2022) - [j36]Kai Wan
Cache-Aided Matrix Multiplication Retrieval. IEEE Trans. Inf. Theory 68(7): 4301-4319 (2022) - [j35]Hua Sun
Secure Groupcast With Shared Keys. IEEE Trans. Inf. Theory 68(7): 4681-4699 (2022) - [j34]Kai Wan
On the Fundamental Limits of Device-to-Device Private Caching Under Uncoded Cache Placement and User Collusion. IEEE Trans. Inf. Theory 68(9): 5701-5729 (2022) - [j33]Yizhou Zhao
Information Theoretic Secure Aggregation With User Dropouts. IEEE Trans. Inf. Theory 68(11): 7471-7484 (2022) - [c43]Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Fundamental Limits of Cache-aided Multiuser PIR: The Two-message Two-user Case. ISIT 2022: 420-425 - [c42]Ali Gholami
Coded Caching With Private Demands and Caches. ISIT 2022: 1396-1401 - [i51]Ali Gholami, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Coded Caching with Private Demands and Caches. CoRR abs/2201.11539 (2022) - [i50]Zhou Li, Hua Sun:
On Extremal Rates of Secure Storage over Graphs. CoRR abs/2204.06511 (2022) - [i49]Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Information Theoretic Secure Aggregation with Uncoded Groupwise Keys. CoRR abs/2204.11364 (2022) - [i48]Yizhou Zhao, Hua Sun:
Secure Summation: Capacity Region, Groupwise Key, and Feasibility. CoRR abs/2205.08458 (2022) - [i47]Zhou Li, Hua Sun:
On Extremal Rates of Storage over Graphs. CoRR abs/2210.06363 (2022) - [i46]Yizhou Zhao, Hua Sun:
MDS Variable Generation and Secure Summation with User Selection. CoRR abs/2211.01220 (2022) - 2021
- [j32]Kai Wan
Cache-Aided General Linear Function Retrieval. Entropy 23(1): 25 (2021) - [j31]Yizhou Zhao
Expand-and-Randomize: An Algebraic Approach to Secure Computation. Entropy 23(11): 1461 (2021) - [j30]Xiang Zhang
On the Fundamental Limits of Cache-Aided Multiuser Private Information Retrieval. IEEE Trans. Commun. 69(9): 5828-5842 (2021) - [j29]Chunhua Geng
Multilevel Topological Interference Management: A TIM-TIN Perspective. IEEE Trans. Commun. 69(11): 7350-7362 (2021) - [j28]Kai Wan
On the Tradeoff Between Computation and Communication Costs for Distributed Linearly Separable Computation. IEEE Trans. Commun. 69(11): 7390-7405 (2021) - [j27]Kai Wan
On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval. IEEE Trans. Inf. Theory 67(6): 4001-4018 (2021) - [c41]Hua Sun:
Compound Secure Groupcast: Key Assignment for Selected Broadcasting. ISIT 2021: 694-699 - [c40]Yizhou Zhao, Hua Sun:
Information Theoretic Secure Aggregation with User Dropouts. ISIT 2021: 1124-1129 - [c39]Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching. ISIT 2021: 1766-1771 - [c38]Ruida Zhou, Chao Tian, Hua Sun, James S. Plank:
Two-Level Private Information Retrieval. ISIT 2021: 1919-1924 - [c37]Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Secure Distributed Linearly Separable Computation. ISIT 2021: 2149-2154 - [c36]Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire:
Cache-Aided Matrix Multiplication Retrieval. ISIT 2021: 2810-2815 - [c35]Zhou Li, Hua Sun:
On the Linear Capacity of Conditional Disclosure of Secrets. ISIT 2021: 3202-3207 - [i45]Ruida Zhou, Chao Tian, Hua Sun, James S. Plank:
Two-Level Private Information Retrieval. CoRR abs/2101.04821 (2021) - [i44]Yizhou Zhao, Hua Sun:
Information Theoretic Secure Aggregation with User Dropouts. CoRR abs/2101.07750 (2021) - [i43]Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
On Secure Distributed Linearly Separable Computation. CoRR abs/2102.00926 (2021) - [i42]Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching. CoRR abs/2102.01643 (2021) - [i41]Chunhua Geng, Hua Sun, Syed Ali Jafar:
Multilevel Topological Interference Management: A TIM-TIN Perspective. CoRR abs/2102.04355 (2021) - [i40]Zhou Li, Hua Sun:
On the Linear Capacity of Conditional Disclosure of Secrets. CoRR abs/2106.04483 (2021) - 2020
- [j26]Xinping Yi
Opportunistic Topological Interference Management. IEEE Trans. Commun. 68(1): 521-535 (2020) - [j25]Xinping Yi
Opportunistic Treating Interference as Noise. IEEE Trans. Inf. Theory 66(1): 520-533 (2020) - [j24]Hua Sun
On the Capacity of Computation Broadcast. IEEE Trans. Inf. Theory 66(6): 3417-3434 (2020) - [j23]Ruida Zhou, Chao Tian
Capacity-Achieving Private Information Retrieval Codes From MDS-Coded Databases With Minimum Message Size. IEEE Trans. Inf. Theory 66(8): 4904-4916 (2020) - [j22]Hua Sun
On the Capacity of Locally Decodable Codes. IEEE Trans. Inf. Theory 66(10): 6566-6579 (2020) - [j21]Hua Sun
Private Information Delivery. IEEE Trans. Inf. Theory 66(12): 7672-7683 (2020) - [c34]Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti
Device-to-Device Private Caching with Trusted Server. ICC 2020: 1-6 - [c33]Zhou Li, Hua Sun:
Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach. ISIT 2020: 944-948 - [c32]Yanliang Zhou, Qiwen Wang, Hua Sun, Shengli Fu:
The Minimum Upload Cost of Symmetric Private Information Retrieval. ISIT 2020: 1030-1034 - [c31]Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji:
Cache-aided Multiuser Private Information Retrieval. ISIT 2020: 1095-1100 - [c30]Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti
Novel Converse for Device-to-Device Demand-Private Caching with a Trusted Server. ISIT 2020: 1705-1710 - [c29]Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti
Cache-Aided Scalar Linear Function Retrieval. ISIT 2020: 1717-1722 - [c28]Fernando Mosquera, Nagendra Gulur, Krishna Kavi, Gayatri Mehta, Hua Sun:
CHASM: Security Evaluation of Cache Mapping Schemes. SAMOS 2020: 245-261 - [c27]Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Private Cache-aided Interference Alignment for Multiuser Private Information Retrieval. WiOpt 2020: 238-245 - [i39]Yizhou Zhao, Hua Sun:
Expand-and-Randomize: An Algebraic Approach to Secure Computation. CoRR abs/2001.00539 (2020) - [i38]Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti
On Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval. CoRR abs/2001.03577 (2020) - [i37]Zhou Li, Hua Sun:
Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach. CoRR abs/2002.05691 (2020) - [i36]Hua Sun:
Compound Secure Groupcast: Key Assignment for Selected Broadcasting. CoRR abs/2004.14986 (2020) - [i35]Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Distributed Linearly Separable Computation. CoRR abs/2007.00345 (2020) - [i34]Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti
Cache-Aided Matrix Multiplication Retrieval. CoRR abs/2007.00856 (2020) - [i33]Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
On the Tradeoff Between Computation and Communication Costs for Distributed Linearly Separable Computation. CoRR abs/2010.01633 (2020) - [i32]Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
On the Fundamental Limits of Cache-aided Multiuser Private Information Retrieval. CoRR abs/2010.06492 (2020) - [i31]Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire:
Cache-aided General Linear Function Retrieval. CoRR abs/2012.14394 (2020)
2010 – 2019
- 2019
- [j20]Hua Sun
Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding. Inf. 10(9): 265 (2019) - [j19]Hua Sun
The Capacity of Symmetric Private Information Retrieval. IEEE Trans. Inf. Theory 65(1): 322-329 (2019) - [j18]Qiwen Wang
The Capacity of Private Information Retrieval With Eavesdroppers. IEEE Trans. Inf. Theory 65(5): 3198-3214 (2019) - [j17]Hua Sun
The Capacity of Anonymous Communications. IEEE Trans. Inf. Theory 65(6): 3871-3879 (2019) - [j16]Hua Sun
The Capacity of Private Computation. IEEE Trans. Inf. Theory 65(6): 3880-3897 (2019) - [j15]Zhuqing Jia
Cross Subspace Alignment and the Asymptotic Capacity of $X$ -Secure $T$ -Private Information Retrieval. IEEE Trans. Inf. Theory 65(9): 5783-5798 (2019) - [j14]Chao Tian
Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost. IEEE Trans. Inf. Theory 65(11): 7613-7627 (2019) - [c26]Yanliang Zhou, Hua Sun, Shengli Fu:
On the Randomness Cost of Linear Secure Computation : (Invited Presentation). CISS 2019: 1-6 - [c25]Hua Sun, Syed Ali Jafar
The Capacity of Linear Computation Broadcast. ICC 2019: 1-6 - [c24]Chao Tian, Hua Sun, Jun Chen:
Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost. ICC 2019: 1-6 - [c23]Qiwen Wang, Hua Sun, Mikael Skoglund:
Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness. ISIT 2019: 365-369 - [c22]Ruida Zhou, Chao Tian, Tie Liu, Hua Sun:
Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size. ISIT 2019: 370-374 - [c21]Xinping Yi, Hua Sun:
Opportunistic Topological Interference Management. ISIT 2019: 1287-1291 - [i30]Hua Sun, Syed Ali Jafar:
On the Capacity of Computation Broadcast. CoRR abs/1903.07597 (2019) - [i29]Ruida Zhou, Chao Tian, Hua Sun, Tie Liu:
Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size. CoRR abs/1903.08229 (2019) - [i28]Hua Sun, Chao Tian:
Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding. CoRR abs/1908.07091 (2019) - [i27]Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti
Device-to-Device Private Caching with Trusted Server. CoRR abs/1909.12748 (2019) - [i26]Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti
Fundamental Limits of Device-to-Device Private Caching with Trusted Server. CoRR abs/1912.09985 (2019) - 2018
- [j13]Hua Sun
Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al. IEEE Trans. Inf. Theory 64(2): 1000-1022 (2018) - [j12]Xinping Yi
TDMA is Optimal for All-Unicast DoF Region of TIM if and only if Topology is Chordal Bipartite. IEEE Trans. Inf. Theory 64(3): 2065-2076 (2018) - [j11]Hua Sun
The Capacity of Robust Private Information Retrieval With Colluding Databases. IEEE Trans. Inf. Theory 64(4): 2361-2370 (2018) - [j10]Hua Sun
Multiround Private Information Retrieval: Capacity and Storage Overhead. IEEE Trans. Inf. Theory 64(8): 5743-5754 (2018) - [c20]Qiwen Wang, Hua Sun, Mikael Skoglund:
The Capacity of Private Information Retrieval with Eavesdroppers. ACSSC 2018: 1679-1683 - [c19]Hua Sun, Syed Ali Jafar
The Capacity of Private Computation. ICC 2018: 1-6 - [c18]Hua Sun:
The Capacity of Anonymous Communications. ISIT 2018: 751-755 - [c17]Chao Tian, Hua Sun, Jun Chen:
A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems. ISIT 2018: 1904-1908 - [c16]Qiwen Wang, Hua Sun, Mikael Skoglund:
The ϵ-error Capacity of Symmetric PIR with Byzantine Adversaries. ITW 2018: 1-5 - [i25]Hua Sun:
The Capacity of Anonymous Communications. CoRR abs/1804.01497 (2018) - [i24]Qiwen Wang, Hua Sun, Mikael Skoglund:
The Capacity of Private Information Retrieval with Eavesdroppers. CoRR abs/1804.10189 (2018) - [i23]Zhuqing Jia, Hua Sun, Syed Ali Jafar:
Cross Subspace Alignment and the Asymptotic Capacity of X-Secure T-Private Information Retrieval. CoRR abs/1808.07457 (2018) - [i22]Chao Tian, Hua Sun, Jun Chen:
Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost. CoRR abs/1808.07536 (2018) - [i21]Xinping Yi, Hua Sun:
Opportunistic Treating Interference as Noise. CoRR abs/1808.08926 (2018) - [i20]Qiwen Wang, Hua Sun, Mikael Skoglund:
The ε-error Capacity of Symmetric PIR with Byzantine Adversaries. CoRR abs/1809.03988 (2018) - [i19]Hua Sun, Syed Ali Jafar:
On the Capacity of Locally Decodable Codes. CoRR abs/1812.05566 (2018) - 2017
- [j9]Hua Sun
Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length. IEEE Trans. Inf. Forensics Secur. 12(12): 2920-2932 (2017) - [j8]Hua Sun
The Capacity of Private Information Retrieval. IEEE Trans. Inf. Theory 63(7): 4075-4088 (2017) - [j7]Bofeng Yuan
Replication-Based Outer Bounds: On the Optimality of "Half the Cake" for Rank-Deficient MIMO Interference Networks. IEEE Trans. Inf. Theory 63(10): 6607-6621 (2017) - [c15]Zhuqing Jia, Hua Sun, Syed Ali Jafar
The Capacity of Private Information Retrieval with Disjoint Colluding Sets. GLOBECOM 2017: 1-6 - [c14]Hua Sun, Syed Ali Jafar
Private information retrieval from MDS coded data with colluding servers: Settling a conjecture by Freij-Hollanti et al. ISIT 2017: 1893-1897 - [i18]Hua Sun, Syed Ali Jafar:
Private Information Retrieval from MDS Coded Data with Colluding Servers: Settling a Conjecture by Freij-Hollanti et al. CoRR abs/1701.07807 (2017) - [i17]Hua Sun, Syed Ali Jafar:
The Capacity of Private Computation. CoRR abs/1710.11098 (2017) - 2016
- [j6]Hua Sun, Syed Ali Jafar
On the Optimality of Treating Interference as Noise for K-User Parallel Gaussian Interference Networks. IEEE Trans. Inf. Theory 62(4): 1911-1930 (2016) - [j5]Chenwei Wang, Hua Sun
Genie Chains: Exploring Outer Bounds on the Degrees of Freedom of MIMO Interference Networks. IEEE Trans. Inf. Theory 62(10): 5573-5602 (2016) - [c13]Hua Sun, Syed Ali Jafar
The capacity of private information retrieval with colluding databases. GlobalSIP 2016: 941-946 - [c12]Hua Sun, Syed Ali Jafar
The Capacity of Private Information Retrieval. GLOBECOM 2016: 1-6 - [c11]Hua Sun, Syed Ali Jafar
The Capacity of Symmetric Private Information Retrieval. GLOBECOM Workshops 2016: 1-5 - [c10]Hua Sun, Syed Ali Jafar
Blind interference alignment for private information retrieval. ISIT 2016: 560-564 - [i16]Hua Sun, Syed Ali Jafar:
Blind Interference Alignment for Private Information Retrieval. CoRR abs/1601.07885 (2016) - [i15]Hua Sun, Syed Ali Jafar:
The Capacity of Private Information Retrieval. CoRR abs/1602.09134 (2016) - [i14]Hua Sun, Syed Ali Jafar:
The Capacity of Robust Private Information Retrieval with Colluding Databases. CoRR abs/1605.00635 (2016) - [i13]Hua Sun, Syed Ali Jafar:
The Capacity of Symmetric Private Information Retrieval. CoRR abs/1606.08828 (2016) - [i12]Hua Sun, Syed Ali Jafar:
Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length. CoRR abs/1610.03048 (2016) - [i11]Hua Sun, Syed Ali Jafar:
Multiround Private Information Retrieval: Capacity and Storage Overhead. CoRR abs/1611.02257 (2016) - 2015
- [j4]Hua Sun, Syed Ali Jafar
Index Coding Capacity: How Far Can One Go With Only Shannon Inequalities? IEEE Trans. Inf. Theory 61(6): 3041-3055 (2015) - [j3]Chunhua Geng, Hua Sun, Syed Ali Jafar
On the Optimality of Treating Interference as Noise: General Message Sets. IEEE Trans. Inf. Theory 61(7): 3722-3736 (2015) - [j2]Hua Sun, Sundar R. Krishnamurthy, Syed Ali Jafar
Rank Matching for Multihop Multiflow. IEEE Trans. Inf. Theory 61(9): 4751-4764 (2015) - [c9]Bofeng Yuan, Hua Sun, Syed Ali Jafar
On the Optimality of "Half the Cake" for K-User Rank-Deficient Mk x Mk Interference Channel. GLOBECOM 2015: 1-5 - [c8]Hua Sun, Syed Ali Jafar
On the separability of GDoF region for parallel Gaussian TIN optimal interference networks. ISIT 2015: 1054-1058 - [i10]Xinping Yi, Hua Sun, Syed Ali Jafar, David Gesbert:
Fractional Coloring (Orthogonal Access) achieves All-unicast Capacity (DoF) Region of Index Coding (TIM) if and only if Network Topology is Chordal. CoRR abs/1501.07870 (2015) - [i9]Bofeng Yuan, Hua Sun, Syed Ali Jafar:
Replication-based Outer bounds and the Optimality of "Half the Cake" for Rank-Deficient MIMO Interference Networks. CoRR abs/1510.05725 (2015) - 2014
- [c7]Hua Sun, Syed Ali Jafar
On the optimality of treating interference as noise for parallel deterministic interference networks. ISIT 2014: 841-845 - [c6]Hua Sun, Syed Ali Jafar
Topological interference management with multiple antennas. ISIT 2014: 1767-1771 - [c5]Chunhua Geng, Hua Sun, Syed Ali Jafar
On the optimality of treating interference as noise: General message sets. ISIT 2014: 1777-1781 - [i8]Chunhua Geng, Hua Sun, Syed Ali Jafar:
On the Optimality of Treating Interference as Noise: General Message Sets. CoRR abs/1401.2592 (2014) - [i7]Hua Sun, Syed Ali Jafar:
On the Optimality of Treating Interference as Noise for K user Parallel Gaussian Interference Networks. CoRR abs/1401.2692 (2014) - [i6]Chenwei Wang, Hua Sun, Syed Ali Jafar:
Genie Chains: Exploring Outer Bounds on the Degrees of Freedom of MIMO Interference Networks. CoRR abs/1404.2258 (2014) - [i5]Hua Sun, Sundar R. Krishnamurthy, Syed Ali Jafar:
Rank Matching for Multihop Multiflow. CoRR abs/1405.0724 (2014) - 2013
- [j1]Hua Sun, Tiangao Gou, Syed Ali Jafar
Degrees of Freedom of MIMO $X$ Networks: Spatial Scale Invariance and One-Sided Decomposability. IEEE Trans. Inf. Theory 59(12): 8377-8385 (2013) - [c4]Hua Sun, Chunhua Geng, Syed Ali Jafar
Topological interference management with alternating connectivity. ISIT 2013: 399-403 - [c3]Chunhua Geng, Hua Sun, Syed Ali Jafar
Multilevel topological interference management. ITW 2013: 1-5 - [i4]Hua Sun, Chunhua Geng, Syed Ali Jafar:
Topological Interference Management with Alternating Connectivity. CoRR abs/1302.4020 (2013) - [i3]Hua Sun, Syed Ali Jafar:
Index Coding Capacity: How far can one go with only Shannon Inequalities? CoRR abs/1303.7000 (2013) - [i2]Chunhua Geng, Hua Sun, Syed Ali Jafar:
Multilevel Topological Interference Management. CoRR abs/1308.5434 (2013) - 2012
- [c2]Hua Sun, Chunhua Geng, Tiangao Gou, Syed Ali Jafar
Degrees of freedom of MIMO X networks: Spatial scale invariance, one-sided decomposability and linear feasibility. ISIT 2012: 2082-2086 - [c1]Chenwei Wang, Hua Sun, Syed Ali Jafar
Genie chains and the degrees of freedom of the K-user MIMO interference channel. ISIT 2012: 2476-2480 - [i1]Hua Sun, Chunhua Geng, Tiangao Gou, Syed Ali Jafar:
Degrees of Freedom of MIMO X Networks: Spatial Scale Invariance, One-Sided Decomposability and Linear Feasibility. CoRR abs/1207.6137 (2012)
Coauthor Index
[j29] [i41] [j24] [j22] [j19] [j16] [j15] [c25] [i30] [j13] [j12] [j11] [j10] [c19] [i23] [i19] [j9] [j8] [j7] [c15] [c14] [i18] [i17] [j6] [j5] [c13] [c12] [c11] [c10] [i16] [i15] [i14] [i13] [i12] [i11] [j4] [j3] [j2] [c9] [c8] [i10] [i9] [c7] [c6] [c5] [i8] [i7] [i6] [i5] [j1] [c4] [c3] [i4] [i3] [i2] [c2] [c1] [i1]
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-11-26 21:41 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: