output
19942026
Showing 2010 · cs.ITShow all

11 papers · 2 filters

cs.IT2010★ 257 cited

Optimal and Robust Transmit Designs for MISO Channel Secrecy by Semidefinite Programming

Qiang Li, Wing-Kin Ma

In recent years there has been growing interest in study of multi-antenna transmit designs for providing secure communication over the physical layer. This paper considers the scen…

cs.IT2010★ 20 cited

Multiple-access Network Information-flow and Correction Codes

Theodoros K. Dikaliotis, Tracey Ho, Sidharth Jaggi +5

This work considers the multiple-access multicast error-correction scenario over a packetized network with malicious edge adversaries. The network has min-cut and packets o…

cs.IT2010★ 1 cited

Universal and Robust Distributed Network Codes

Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko +1

Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented over finite…

cs.IT2010

Competition of Wireless Providers for Atomic Users

Vojislav Gajić, Jianwei Huang, Bixio Rimoldi

We study a problem where wireless service providers compete for heterogenous wireless users. The users differ in their utility functions as well as in the perceived quality of serv…

cs.IT2010

On extracting common random bits from correlated sources

Andrej Bogdanov, Elchanan Mossel

Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of rand…

cs.IT2010★ 39 cited

Construction and Applications of CRT Sequences

Kenneth W. Shum, Wing Shing Wong

Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the p…

cs.IT2010

Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee

Kenneth W. Shum, Wing Shing Wong

Protocol sequences are used in channel access for the multiple-access collision channel without feedback. A new construction of protocol sequences with a guarantee of worst-case sy…

cs.IT2010★ 27 cited

On Linear Operator Channels over Finite Fields

Shenghao Yang, Siu-Wai Ho, Jin Meng +2

Motivated by linear network coding, communication channels perform linear operation over finite fields, namely linear operator channels (LOCs), are studied in this paper. For such…

cs.IT2010★ 10 cited

Concatenated Polar Codes

Mayank Bakshi, Sidharth Jaggi, Michelle Effros

Polar codes have attracted much recent attention as the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-th…

cs.IT2010★ 1 cited

An information inequality and evaluation of Marton's inner bound for binary input broadcast channels

Chandra Nair, Zizhou Vincent Wang, Yanlin Geng

We establish an information inequality that is intimately connected to the evaluation of the sum rate given by Marton's inner bound for two receiver broadcast channels with a binar…

cs.IT2010

The capacity region of a class of broadcast channels with a sequence of less noisy receivers

Chandra Nair, Zizhou Vincent Wang

The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k >= 3. We solve this problem for the case k=3. We p…