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
10 papers · 2 filters
Signal-Aligned Network Coding in K-User MIMO Interference Channels with Limited Receiver Cooperation
Tse-Tin Chan, Tat-Ming Lok
In this paper, we propose a signal-aligned network coding (SNC) scheme for K-user time-varying multiple-input multiple-output (MIMO) interference channels with limited receiver coo…
On the Duality of Fractional Repetition Codes
Bing Zhu, Kenneth W. Shum, Hui Li
Erasure codes have emerged as an efficient technology for providing data redundancy in distributed storage systems. However, it is a challenging task to repair the failed storage n…
Improved Upper Bound on the Network Function Computing Capacity
Xuan Guang, Raymond W. Yeung, Shenghao Yang +1
The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a {\em…
Nearly Optimal Sparse Group Testing
Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi +1
Group testing is the process of pooling arbitrary subsets from a set of items so as to identify, with a minimal number of tests, a "small" subset of defective items. In "cl…
Double-Edge Factor Graphs: Definition, Properties, and Examples
Michael X. Cao, Pascal O. Vontobel
Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs \emph{without cycles} and moderate message update…
Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information Per Bit
Chung Chan
The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users inde…
Short Codes with Mismatched Channel State Information: A Case Study
Gianluigi Liva, Giuseppe Durisi, Marco Chiani +2
The rising interest in applications requiring the transmission of small amounts of data has recently lead to the development of accurate performance bounds and of powerful channel…
Estimating the Information Rate of a Channel with Classical Input and Output and a Quantum State (Extended Version)
Michael X. Cao, Pascal O. Vontobel
We consider the problem of transmitting classical information over a time-invariant channel with memory. A popular class of time-invariant channels with memory are finite-state-mac…
Generalized Compute-Compress-and-Forward
Hai Cheng, Xiaojun Yuan, Yihua Tan
Compute-and-forward (CF) harnesses interference in wireless communications by exploiting structured coding. The key idea of CF is to compute integer combinations of codewords from…
On the Optimality of Secret Key Agreement via Omniscience
Chung Chan, Manuj Mukherjee, Navin Kashyap +1
For the multiterminal secret key agreement problem under a private source model, it is known that the maximum key rate, i.e., the secrecy capacity, can be achieved through communic…