output
19942026
Showing 2012 · cs.ITShow all

17 papers · 2 filters

cs.IT2012

Performance Bounds on a Wiretap Network with Arbitrary Wiretap Sets

Fan Cheng, Raymond W. Yeung

Consider a communication network represented by a directed graph , where is the set of nodes and is the set of po…

cs.IT2012★ 4 cited

A Decentralized Method for Joint Admission Control and Beamforming in Coordinated Multicell Downlink

Hoi-To Wai, Wing-Kin Ma

In cellular networks, admission control and beamforming optimization are intertwined problems. While beamforming optimization aims at satisfying users' quality-of-service (QoS) req…

cs.IT2012

Multiple-Input Multiple-Output Two-Way Relaying: A Space-Division Approach

Xiaojun Yuan, Tao Yang, Iain B. Collings

We propose a novel space-division based network-coding scheme for multiple-input multiple-output (MIMO) two-way relay channels (TWRCs), in which two multi-antenna users exchange in…

cs.IT2012★ 5 cited

Analysis and Construction of Functional Regenerating Codes with Uncoded Repair for Distributed Storage Systems

Yuchong Hu, Patrick P. C. Lee, Kenneth W. Shum

Modern distributed storage systems apply redundancy coding techniques to stored data. One form of redundancy is based on regenerating codes, which can minimize the repair bandwidth…

cs.IT2012★ 8 cited

Cooperative Regenerating Codes

Kenneth W. Shum, Yuchong Hu

One of the design objectives in distributed storage system is the minimization of the data traffic during the repair of failed storage nodes. By repairing multiple failures simulta…

cs.IT2012★ 10 cited

Wireless MIMO Switching: Weighted Sum Mean Square Error and Sum Rate Optimization

Fanggang Wang, Xiaojun Yuan, Soung Chang Liew +1

This paper addresses joint transceiver and relay design for a wireless multiple-input-multiple-output (MIMO) switching scheme that enables data exchange among multiple users. Here,…

cs.IT2012★ 21 cited

Conditional Information Inequalities for Entropic and Almost Entropic Points

Tarik Kaced, Andrei Romashchenko

We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We pro…

cs.IT2012★ 146 cited

Batched Sparse Codes

Shenghao Yang, Raymond W. Yeung

Network coding can significantly improve the transmission rate of communication networks with packet loss compared with routing. However, using network coding usually incurs high c…

cs.IT2012

Analog Network Coding in General SNR Regime: Performance of Network Simplification

Samar Agnihotri, Sidharth Jaggi, Minghua Chen

We consider a communication scenario where a source communicates with a destination over a directed layered relay network. Each relay performs analog network coding where it scales…

cs.IT2012★ 32 cited

Upper Bounds on the Capacity of Binary Channels with Causal Adversaries

Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg +1

In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a…

cs.IT2012★ 28 cited

Worst-Case Robust Multiuser Transmit Beamforming Using Semidefinite Relaxation: Duality and Implications

Tsung-Hui Chang, Wing-Kin Ma, Chong-Yung Chi

This paper studies a downlink multiuser transmit beamforming design under spherical channel uncertainties, using a worst-case robust formulation. This robust design problem is nonc…

cs.IT2012★ 1 cited

On Marton's inner bound for broadcast channels

Amin Gohari, Chandra Nair, Venkat Anantharam

Marton's inner bound is the best known achievable region for a general discrete memoryless broadcast channel. To compute Marton's inner bound one has to solve an optimization probl…

cs.IT2012

Imperfect Secrecy in Wiretap Channel II

Fan Cheng, Raymond W. Yeung, Kenneth W. Shum

In a point-to-point communication system which consists of a sender, a receiver and a set of noiseless channels, the sender wishes to transmit a private message to the receiver thr…

cs.IT2012★ 5 cited

Analog Network Coding in General SNR Regime

Samar Agnihotri, Sidharth Jaggi, Minghua Chen

The problem of maximum rate achievable with analog network coding for a unicast communication over a layered wireless relay network with directed links is considered. A relay node…

cs.IT2012★ 44 cited

Non-adaptive Group Testing: Explicit bounds and novel algorithms

Chun Lam Chan, Sidharth Jaggi, Venkatesh Saligrama +1

We consider some computationally efficient and provably correct algorithms with near-optimal sample-complexity for the problem of noisy non-adaptive group testing. Group testing in…

cs.IT2012★ 1 cited

The capacity region of the two-receiver vector Gaussian broadcast channel with private and common messages

Yanlin Geng, Chandra Nair

We develop a new method for showing the optimality of the Gaussian distribution in multiterminal information theory problems. As an application of this method we show that Marton's…

cs.IT2012★ 3 cited

Duality of Channel Encoding and Decoding - Part I: Rate-1 Binary Convolutional Codes

Yonghui Li, Qimin You, Soung C. Liew +1

In this paper, we revisit the forward, backward and bidirectional Bahl-Cocke-Jelinek-Raviv (BCJR) soft-input soft-output (SISO) maximum a posteriori probability (MAP) decoding proc…