Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Tsinghua UniversityCN1.1k papers
- Chinese Academy of SciencesCN1.1k papers
- The University of TokyoJP1k papers
- University of Hong KongHK1k papers
- University of Science and Technology of ChinaCN1k papers
- Centre National de la Recherche ScientifiqueFR1k papers
- National Institute for Subatomic PhysicsNL993 papers
- University of CambridgeGB987 papers
- University of MichiganUS984 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di NapoliIT966 papers
- University of ChicagoUS961 papers
- Nanjing UniversityCN958 papers
15 papers · 2 filters
Non-memoryless Analog Network Coding in Two-Way Relay Channel
Shengli Zhang, Soung-Chang Liew, Qingfeng Zhou +2
Physical-layer Network Coding (PNC) can significantly improve the throughput of two-way relay channels. An interesting variant of PNC is Analog Network Coding (ANC). Almost all ANC…
Online Robust Subspace Tracking from Partial Information
Jun He, Laura Balzano, John C. S. Lui
This paper presents GRASTA (Grassmannian Robust Adaptive Subspace Tracking Algorithm), an efficient and robust online algorithm for tracking subspaces from highly incomplete inform…
Binary Error Correcting Network Codes
Qiwen Wang, Sidharth Jaggi, Shuo-Yen Robert Li
We consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. We dem…
Outage Constrained Robust Transmit Optimization for Multiuser MISO Downlinks: Tractable Approximations by Conic Optimization
Kun-Yu Wang, Anthony Man-Cho So, Tsung-Hui Chang +2
In this paper we consider a probabilistic signal-to-interference and-noise ratio (SINR) constrained problem for transmit beamforming design in the presence of imperfect channel sta…
Capacity Analysis of Linear Operator Channels over Finite Fields
Shenghao Yang, Siu-Wai Ho, Jin Meng +1
Motivated by communication through a network employing linear network coding, capacities of linear operator channels (LOCs) with arbitrarily distributed transfer matrices over fini…
Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms
Chun Lam Chan, Pak Hou Che, Sidharth Jaggi +1
We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measuremen…
Asynchronous Physical-layer Network Coding
Lu Lu, Soung Chang Liew
A key issue in physical-layer network coding (PNC) is how to deal with the asynchrony between signals transmitted by multiple transmitters. That is, symbols transmitted by differen…
Amplify-and-Forward in Wireless Relay Networks
Samar Agnihotri, Sidharth Jaggi, Minghua Chen
A general class of wireless relay networks with a single source-destination pair is considered. Intermediate nodes in the network employ an amplify-and-forward scheme to relay thei…
The capacity region of classes of product broadcast channels
Yanlin Geng, Amin Gohari, Chandra Nair +1
We establish a new outer bound for the capacity region of product broadcast channels. This outer bound matches Marton's inner bound for a variety of classes of product broadcast ch…
Wireless MIMO Switching
Fanggang Wang, Soung Chang Liew
In a generic switching problem, a switching pattern consists of a one-to-one mapping from a set of inputs to a set of outputs (i.e., a permutation). We propose and investigate a wi…
Low Complexity Kolmogorov-Smirnov Modulation Classification
Fanggang Wang, Rongtao Xu, Zhangdui Zhong
Kolmogorov-Smirnov (K-S) test-a non-parametric method to measure the goodness of fit, is applied for automatic modulation classification (AMC) in this paper. The basic procedure in…
Low-Complexity Near-Optimal Codes for Gaussian Relay Networks
Theodoros K. Dikaliotis, Hongyi Yao, Salman Avestimehr +2
We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr \emph{et al.} [1], we propose network codes that achieve up to a…
Cooperative Regenerating Codes for Distributed Storage Systems
Kenneth W. Shum
When there are multiple node failures in a distributed storage system, regenerating the failed storage nodes individually in a one-by-one manner is suboptimal as far as repair-band…
Generation of Innovative and Sparse Encoding Vectors for Broadcast Systems with Feedback
Ho Yuet Kwan, Kenneth W. Shum, Chi Wan Sung
In the application of linear network coding to wireless broadcasting with feedback, we prove that the problem of determining the existence of an innovative encoding vector is NP-co…
Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems
Kenneth W. Shum, Yuchong Hu
In order to provide high data reliability, distributed storage systems disperse data with redundancy to multiple storage nodes. Regenerating codes is a new class of erasure codes t…