IEEE Transactions on Information Theory

Issue 1 • Jan. 2011

Filter Results

Displaying Results 1 - 25 of 49
  • Table of contents

    Publication Year: 2011, Page(s):C1 - C4
    Request permission for commercial reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2011, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (42 KB)
    Freely Available from IEEE
  • 2010 Associate editors list

    Publication Year: 2011, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • 2010 IEEE Information Theory Society Paper Award

    Publication Year: 2011, Page(s): 2
    Request permission for commercial reuse | PDF file iconPDF (226 KB) | HTML iconHTML
    Freely Available from IEEE
  • 2010 IEEE Communications Society and Information Theory Society Joint Paper Award

    Publication Year: 2011, Page(s): 3
    Request permission for commercial reuse | PDF file iconPDF (386 KB) | HTML iconHTML
    Freely Available from IEEE
  • Multicasting Multiple Correlated Sources to Multiple Sinks Over a Noisy Channel Network

    Publication Year: 2011, Page(s):4 - 13
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li, and Yeung in 2000, in which they have established the celebrated max-flow min-cut theorem on nonphysical information flow over a network of independent channels. On the other hand, in 1980, Han has studied the case with multiple correlated sources and a single sink from the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicasting in Large Wireless Networks: Bounds on the Minimum Energy Per Bit

    Publication Year: 2011, Page(s):14 - 32
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    In this paper, we consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied-dense random networks and constant density (extended) random networks. In addition, we also study finite size regular networks in order to understand how regular... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information Theoretic Proofs of Entropy Power Inequalities

    Publication Year: 2011, Page(s):33 - 55
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (465 KB) | HTML iconHTML

    While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the EPI hinge on representations of differential entropy using either Fisher information or minimum mean-square error (MMSE), which are derived from de Bruijn's id... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Data Processing Inequality and Its Applications in Distributed Source and Channel Coding

    Publication Year: 2011, Page(s):56 - 69
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    In the distributed coding of correlated sources, the problem of characterizing the joint probability distribution of a pair of random variables satisfying an n-letter Markov chain arises. The exact solution of this problem is intractable. In this paper, we seek a single-letter necessary condition for this n-letter Markov chain. To this end, we propose a new data processing inequality on a new meas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guessing Revisited: A Large Deviations Approach

    Publication Year: 2011, Page(s):70 - 78
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (221 KB) | HTML iconHTML

    The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation property with a certain rate function, then the limiting guessing exponent exists and is a scalar multiple of the Legendre-Fenchel dual of the rate function. Oth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Distributed Compression of Linear Functions

    Publication Year: 2011, Page(s):79 - 94
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (498 KB) | HTML iconHTML

    Distributed compression of a pair of Gaussian sources in which the goal is to reproduce a linear function of the sources at the decoder is considered. It has recently been noted that lattice codes can provide improved compression rates for this problem compared to conventional, unstructured codes. It is first shown that the state-of-the-art lattice scheme can be improved by including an additional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Equivalence of Two Achievable Regions for the Broadcast Channel

    Publication Year: 2011, Page(s):95 - 100
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (231 KB) | HTML iconHTML

    A recent inner bound on the capacity region of the two-receiver discrete memoryless broadcast channel is shown to be equivalent to the Marton-Gelfand-Pinsker region. The proof method is based on a result of Gelfand and Pinsker concerning channel input distributions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Exponents for Broadcast Channels With Degraded Message Sets

    Publication Year: 2011, Page(s):101 - 123
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (737 KB) | HTML iconHTML

    We consider a broadcast channel with a degraded message set, in which a single transmitter sends a common message to two receivers and a private message to one of the receivers only. The main goal of this work is to find new lower bounds to the error exponents of the strong user, the one that should decode both messages, and of the weak user, that should decode only the common message. Unlike prev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Characterizations for the Gaussian Source Broadcast Distortion Region

    Publication Year: 2011, Page(s):124 - 136
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB) | HTML iconHTML

    We consider the joint source-channel coding problem of sending a Gaussian source on a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of introducing more than one additional auxiliary random variable, which was previously used to derive sum-rate lower bound for the symmetric Gaussian multiple descriptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secrecy in Cooperative Relay Broadcast Channels

    Publication Year: 2011, Page(s):137 - 155
    Cited by:  Papers (84)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (471 KB) | HTML iconHTML

    We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference Channels With Source Cooperation

    Publication Year: 2011, Page(s):156 - 186
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (799 KB) | HTML iconHTML

    In this paper, the role of cooperation in managing interference-a fundamental feature of the wireless channel-is investigated by studying the two-user Gaussian interference channel where the source nodes can both transmit and receive in full duplex. The sum capacity of this channel is obtained within a gap of a constant number of bits. The coding scheme used builds up on the superposition scheme o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference Channels With Destination Cooperation

    Publication Year: 2011, Page(s):187 - 209
    Cited by:  Papers (81)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB) | HTML iconHTML

    Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being able to both transmit and receive is studied. The sum capacity of this channel is characterized up to a constant number of bits. The coding scheme employed buil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels

    Publication Year: 2011, Page(s):210 - 226
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (909 KB) | HTML iconHTML

    The sum-rate capacity of the parallel Gaussian interference channel is shown to be achieved by independent transmission across subchannels and treating interference as noise if the channel coefficients and power constraints satisfy a certain condition. The condition requires the interference to be weak, a situation commonly encountered, e.g., in digital subscriber line transmission. The optimal po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polymatroidal Flows on Two Classes of Information Networks

    Publication Year: 2011, Page(s):227 - 233
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (186 KB) | HTML iconHTML

    We present inner bounds to the broadcast capacity region of two classes of information networks: Networks of Multiple Access Channels (MACs) and Networks of Deterministic Broadcast Channels (DBCs). Our achievability scheme is a separation based scheme consisting of a physical layer that involves “cleaning up” the constituent channels in the network to create a point-to-point wired ov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate Scaling Laws in Multicell Networks Under Distributed Power Control and User Scheduling

    Publication Year: 2011, Page(s):234 - 244
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB) | HTML iconHTML

    We analyze the sum rate performance in multicell single-hop networks where access points are allowed to cooperate in terms of a joint resource allocation. The resource allocation policies considered here combine power control and user scheduling. Although promising from a conceptual point of view, the optimization of the sum of per-link rates hinges on tough issues such as computational complexity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pareto and Energy-Efficient Distributed Power Control With Feasibility Check in Wireless Networks

    Publication Year: 2011, Page(s):245 - 255
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (390 KB) | HTML iconHTML

    We formally define the gradual removal problem in wireless networks, where the smallest number of users should be removed due to infeasibility of the target-SIR requirements for all users, and present a distributed power-control algorithm with temporary removal and feasibility check (DFC) to address it. The basic idea is that any transmitting user whose required transmit power for reaching its tar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Occupancy Distributions of Homogeneous Queueing Systems Under Opportunistic Scheduling

    Publication Year: 2011, Page(s):256 - 266
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (367 KB) | HTML iconHTML

    This paper analyzes opportunistic schemes for transmission scheduling from one of n homogeneous queues whose channel states fluctuate independently. Considered schemes consist of an LCQ policy that transmits from a longest connected queue in the entire system, and its low-complexity variant LCQ(d) that transmits from a longest queue within a randomly chosen subset of d ≥ 1 connected queues.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stable Throughput for Multicast With Random Linear Coding

    Publication Year: 2011, Page(s):267 - 281
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler observes the lengths of all queues and the connectivities of all links and can transmit the head-of-the-line packet from a single queue. We juxtapose this to a coding strategy that is simply a form of classical random li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks

    Publication Year: 2011, Page(s):282 - 290
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    We consider a dense K user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal attenuation, we prove convergence in probability of the average per-user capacity CΣ/K to 1/2E log(1 + 2SNR). The achievability result follows directly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Secure Degrees of Freedom of Relaying With Half-Duplex Feedback

    Publication Year: 2011, Page(s):291 - 302
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (415 KB) | HTML iconHTML

    Secure communication protocols over a single-relay system in the presence of a multiple-antenna eavesdropper are investigated. When there is no direct link between the source and the destination, an amplify-and-forward (AF) protocol that allows both the destination and the source to jam the eavesdropper is shown to achieve secrecy rates that grow linearly with the transmit power in dB, even if all... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Prakash Narayan 

Department of Electrical and Computer Engineering