TIT
2010
13 years 7 months ago
2010
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an ex...
TIT
2010
13 years 7 months ago
2010
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bou...
TIT
2010
13 years 7 months ago
2010
Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In part I, the fundamental limits of asynchronous CDMA systems were analyzed in terms of total cap...
TIT
2010
13 years 7 months ago
2010
TIT
2010
13 years 7 months ago
2010
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
TIT
2010
13 years 7 months ago
2010
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
TIT
2010
13 years 7 months ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
TIT
2010
13 years 7 months ago
2010
Abstract-- In a relay network with a single sourcedestination pair, we examine the achievable rates with amplifyand-forward (AF) relaying strategy. Motivated by applications in sen...
TIT
2010
13 years 7 months ago
2010
This paper considers recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from...
TIT
2010
13 years 7 months ago
2010
We consider channels with action-dependent states: Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel state...