output
19942026
Showing 2009 · cs.ITShow all

8 papers · 2 filters

cs.IT2009★ 37 cited

A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes

Kenneth W. Shum, Wing Shing Wong, Chung Shue Chen

Conflict-avoiding codes are used in the multiple-access collision channel without feedback. The number of codewords in a conflict-avoiding code is the number of potential users tha…

cs.IT2009★ 11 cited

Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit

Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye

Motivated by the philosophy and phenomenal success of compressed sensing, the problem of reconstructing a matrix from a sampling of its entries has attracted much attention recentl…

cs.IT2009★ 13 cited

Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding

Amir-Hamed Mohsenian-Rad, Jianwei Huang, Vincent W. S. Wong +2

A common assumption in the existing network coding literature is that the users are cooperative and non-selfish. However, this assumption can be violated in practice. In this paper…

cs.IT2009★ 46 cited

Refined Coding Bounds and Code Constructions for Coherent Network Error Correction

Shenghao Yang, Raymond W. Yeung, Chi-Kin Ngai

Coherent network error correction is the error-control problem in network coding with the knowledge of the network codes at the source and sink nodes. With respect to a given set o…

cs.IT2009

Cooperative Transmission in a Wireless Relay Network based on Flow Management

Debdeep Chatterjee, Tan F. Wong, Tat M. Lok

In this paper, a cooperative transmission design for a general multi-node half-duplex wireless relay network is presented. It is assumed that the nodes operate in half-duplex mode…

cs.IT2009★ 9 cited

Binary Causal-Adversary Channels

Michael Langberg, Sidharth Jaggi, Bikash Kumar Dey

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.IT2009★ 11 cited

Comments on "Broadcast Channels with Arbitrarily Correlated Sources"

Gerhard Kramer, Chandra Nair

The Marton-Gelfand-Pinsker inner bound on the capacity region of broadcast channels was extended by Han-Costa to include arbitrarily correlated sources where the capacity region is…

cs.IT2009★ 2 cited

Capacity regions of two new classes of 2-receiver broadcast channels

Chandra Nair

Motivated by a simple broadcast channel, we generalize the notions of a less noisy receiver and a more capable receiver to an essentially less noisy receiver and an essentially mor…