output
19942026
Showing 2017 · cs.ITShow all

10 papers · 2 filters

cs.IT2017★ 6 cited

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…

cs.IT2017★ 2 cited

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…

cs.IT2017★ 1 cited

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…

cs.IT2017

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…

cs.IT2017★ 8 cited

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…

cs.IT2017★ 2 cited

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…

cs.IT2017★ 3 cited

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…

cs.IT2017★ 7 cited

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…

cs.IT2017

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…

cs.IT2017★ 1 cited

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…