output
19942026
Showing 2016 · cs.ITShow all

22 papers · 2 filters

cs.IT2016

Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach

Xuan Guang, Raymond W. Yeung

We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets…

cs.IT2016★ 1 cited

Determining Optimal Rates for Communication for Omniscience

Ni Ding, Chung Chan, Qiaoqiao Zhou +2

This paper considers the communication for omniscience (CO) problem: A set of users observe a discrete memoryless multiple source and want to recover the entire multiple source via…

cs.IT2016

New CRT sequence sets for a collision channel without feedback

Yijin Zhang, Yuan-Hsun Lo, Kenneth W. Shum +1

Protocol sequences are binary and periodic sequences used for deterministic multiple access in a collision channel without feedback. In this paper, we focus on user-irrepressible (…

cs.IT2016★ 1 cited

Multiuser Rate-Diverse Network-Coded Multiple Access

Haoyuan Pan, Lu Lu, Soung Chang Liew

This paper presents the first Network-Coded Multiple Access (NCMA) system with multiple users adopting different signal modulations, referred to as rate-diverse NCMA. A distinguish…

cs.IT2016★ 53 cited

Sum Secrecy Rate Maximization for Full-Duplex Two-Way Relay Networks Using Alamouti-based Rank-Two Beamforming

Qiang Li, Wing-Kin Ma, Dong Han

Consider a two-way communication scenario where two single-antenna nodes, operating under full-duplex mode, exchange information to one another through the aid of a (full-duplex) m…

cs.IT2016★ 43 cited

Non-Uniform Linear Antenna Array Design and Optimization for Millimeter Wave Communications

Peng Wang, Yonghui Li, Yuexing Peng +2

In this paper, we investigate the optimization of non-uniform linear antenna arrays (NULAs) for millimeter wave (mmWave) line-of-sight (LoS) multiple-input multiple-output (MIMO) c…

cs.IT2016★ 44 cited

On Optimal Fronthaul Compression and Decoding Strategies for Uplink Cloud Radio Access Networks

Yuhan Zhou, Yinfei Xu, Wei Yu +1

This paper investigates the compress-and-forward scheme for an uplink cloud radio access network (C-RAN) model, where multi-antenna base-stations (BSs) are connected to a cloud-com…

cs.IT2016★ 1 cited

Complex Linear Physical-Layer Network Coding

Long Shi, Soung Chang Liew

This paper presents the results of a comprehensive investigation of complex linear physical-layer network (PNC) in two-way relay channels (TWRC). A critical question at relay R is…

cs.IT2016

A Faster Algorithm for Asymptotic Communication for Omniscience

Ni Ding, Chung Chan, Qiaoqiao Zhou +2

We propose a modified decomposition algorithm (MDA) to solve the asymptotic communication for omniscience (CO) problem where the communication rates could be real or fractional. By…

cs.IT2016★ 1 cited

A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers--Wannier Duality

Ali Al-Bashabsheh, Pascal O. Vontobel

Algebraic topology studies topological spaces with the help of tools from abstract algebra. The main focus of this paper is to show that many concepts from algebraic topology can b…

cs.IT2016★ 2 cited

Computationally Efficient Covert Communication

Qiaosheng Zhang, Mayank Bakshi, Sidharth Jaggi

In this paper, we design the first computationally efficient codes for simultaneously reliable and covert communication over Binary Symmetric Channels (BSCs). Our setting is as fol…

cs.IT2016

On the Optimality of Time Division for Broadcast Channels

Salman Beigi

We provide a necessary and sufficient condition that under some technical assumption characterizes all two-receiver broadcast channels for which time division is optimal for transm…

cs.IT2016★ 3 cited

Incremental and Decremental Secret Key Agreement

Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou

We study the rate of change of the multivariate mutual information among a set of random variables when some common randomness is added to or removed from a subset. This is formula…

cs.IT2016★ 1 cited

On the Performance of Mobile Visible Light Communications

Yang Hong, Lian-Kuan Chen

We experimentally characterize the performance of mobile VLC and propose using OCT precoding to combat mobility-induced performance degradation. Results show that for approximate 3…

cs.IT2016

Arbitrarily Varying Networks: Capacity-achieving Computationally Efficient Codes

Peida Tian, Sidharth Jaggi, Mayank Bakshi +1

We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communicatio…

cs.IT2016

Semidefinite Relaxation and Approximation Analysis of a Beamformed Alamouti Scheme for Relay Beamforming Networks

Sissi Xiaoxiao Wu, Anthony Man-Cho So, Jiaxian Pan +1

In this paper, we study the amplify-and-forward (AF) schemes in two-hop one-way relay networks. In particular, we consider the multigroup multicast transmission between long-distan…

cs.IT2016★ 25 cited

Unraveling the Rank-One Solution Mystery of Robust MISO Downlink Transmit Optimization: A Verifiable Sufficient Condition via a New Duality Result

Wing-Kin Ma, Jiaxian Pan, Anthony Man-Cho So +1

This paper concentrates on a robust transmit optimization problem for the multiuser multi-input single-output (MISO) downlink scenario and under inaccurate channel state informatio…

cs.IT2016★ 1 cited

The Capacity of Online (Causal) -ary Error-Erasure Channels

Zitan Chen, Sidharth Jaggi, Michael Langberg

In the -ary online (or "causal") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword $\mathbf{x} =(x_1,\ldots,x_n) \in \{0,1,…

cs.IT2016★ 9 cited

Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model

Manuj Mukherjee, Chung Chan, Navin Kashyap +1

In the multiterminal source model of Csiszr and Narayan, the communication complexity, , for secret key (SK) generation is the minimum rate of communicatio…

cs.IT2016

Fairness in Communication for Omniscience

Ni Ding, Chung Chan, Qiaoqiao Zhou +2

We consider the problem of how to fairly distribute the minimum sum-rate among the users in communication for omniscience (CO). We formulate a problem of minimizing a weighted quad…

cs.IT2016

Balanced Reed-Solomon Codes

Wael Halbawi, Zihan Liu, Babak Hassibi

We consider the problem of constructing linear Maximum Distance Separable (MDS) error-correcting codes with generator matrices that are sparsest and balanced. In this context, spar…

cs.IT2016★ 114 cited

Artificial Noise Aided Secrecy Information and Power Transfer in OFDMA Systems

Meng Zhang, Yuan Liu, Rui Zhang

In this paper, we study simultaneous wireless information and power transfer (SWIPT) in orthogonal frequency division multiple access (OFDMA) systems with the coexistence of inform…