# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 47

Publication Year: 2010, Page(s):C1 - C4
| PDF (47 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2010, Page(s): C2
| PDF (42 KB)
• ### On Pinsker's and Vajda's Type Inequalities for Csiszár's $f$ -Divergences

Publication Year: 2010, Page(s):5377 - 5386
Cited by:  Papers (18)
| | PDF (306 KB) | HTML

Let D and V denote respectively Information Divergence and Total Variation Distance. Pinsker's and Vajda's inequalities are respectively D ≥ [ 1/ 2] V2 and D ≥ log[( 2+V)/( 2-V)] - [( 2V)/( 2+V)]. In this paper, several generalizations and improvements of these inequalities are established for wide classes of &... View full abstract»

• ### Monotonicity, Thinning, and Discrete Versions of the Entropy Power Inequality

Publication Year: 2010, Page(s):5387 - 5395
Cited by:  Papers (19)
| | PDF (222 KB) | HTML

We consider the entropy of sums of independent discrete random variables, in analogy with Shannon's Entropy Power Inequality, where equality holds for normals. In our case, infinite divisibility suggests that equality should hold for Poisson variables. We show that some natural analogues of the EPI do not in fact hold, but propose an alternative formulation which does always hold. The key to many ... View full abstract»

• ### Capacity of Channels With Action-Dependent States

Publication Year: 2010, Page(s):5396 - 5411
Cited by:  Papers (53)  |  Patents (1)
| | PDF (378 KB) | HTML

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 states, and then creates the channel input sequence based on the state sequence. We characterize the capacity of such a channel both for the case where the channel inputs are allowed to depend noncausally on the state sequence... View full abstract»

• ### Noisy Constrained Capacity for BSC Channels

Publication Year: 2010, Page(s):5412 - 5423
Cited by:  Papers (2)
| | PDF (294 KB) | HTML

We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose input is a sequence from a constrained set. As stated by Fan , “... while calculation of the noise-free capacity of constrained sequences is well known, the computation of the capacity of a constraint in the presence of noise ... has been an uns... View full abstract»

• ### Achievable Error Exponents for Channels With Side Information—Erasure and List Decoding

Publication Year: 2010, Page(s):5424 - 5431
Cited by:  Papers (3)
| | PDF (227 KB) | HTML

We consider a decoder with an erasure option and a variable size list decoder for channels with non-casual side information at the transmitter. First, a universally achievable region of error exponents is offered for decoding with an erasure option using a parameterized decoder in the spirit of Csiszár and Körner's decoder. Then, the proposed decoding rule is generalized by extendi... View full abstract»

• ### On the AWGN MAC With Imperfect Feedback

Publication Year: 2010, Page(s):5432 - 5476
Cited by:  Papers (14)
| | PDF (876 KB) | HTML

New achievable rate regions are derived for the two-user additive white Gaussian multiple-access channel with noisy feedback. The regions exhibit the following two properties. Irrespective of the (finite) Gaussian feedback-noise variances, the regions include rate points that lie outside the no-feedback capacity region, and when the feedback-noise variances tend to zero the regions converge to the... View full abstract»

• ### Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages

Publication Year: 2010, Page(s):5477 - 5487
Cited by:  Papers (50)
| | PDF (297 KB) | HTML

This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message intended only for receiver 1 but needing to be kept asymptotically perfectly secure from receiver 2. A matrix characterization of the secrecy capacity region is estab... View full abstract»

• ### Capacity of the Gaussian Two-Way Relay Channel to Within ${1over 2}$ Bit

Publication Year: 2010, Page(s):5488 - 5494
Cited by:  Papers (224)  |  Patents (1)
| | PDF (318 KB) | HTML

In this paper, a Gaussian two-way relay channel, where two source nodes exchange messages with each other through a relay, is considered. We assume that all nodes operate in full-duplex mode and there is no direct channel between the source nodes. We propose an achievable scheme composed of nested lattice codes for the uplink and structured binning for the downlink. Unlike conventional nested latt... View full abstract»

• ### On Information Rates of the Fading Wyner Cellular Model via the Thouless Formula for the Strip

Publication Year: 2010, Page(s):5495 - 5514
Cited by:  Papers (5)
| | PDF (980 KB) | HTML

In this paper, we apply the theory of random Schrödinger operators to the analysis of multiusers communication channels similar to the Wyner model, which are characterized by short-range intercell interference. With H the channel transfer matrix, HHf is a narrow band matrix, a fact that does not permit the use of classical random matrices theory. On the other hand,... View full abstract»

• ### Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel

Publication Year: 2010, Page(s):5515 - 5532
Cited by:  Papers (509)
| | PDF (498 KB) | HTML

The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are fixed and known to all the terminals. A computable characterization of the secrecy capacity is established as the saddle point solution to a minimax problem. The converse is based on a Sato-type argument used in other... View full abstract»

• ### Resilience to Degree-Dependent and Cascading Node Failures in Random Geometric Networks

Publication Year: 2010, Page(s):5533 - 5546
Cited by:  Papers (20)
| | PDF (1811 KB) | HTML

This paper studies the problem of resilience to node failures in large-scale networks modelled by random geometric graphs. Adopting a percolation-based viewpoint, the paper investigates the ability of the network to maintain global communication in the face of dependent node failures. Degree-dependent site percolation processes on random geometric graphs are examined, and the first known analytica... View full abstract»

• ### Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access

Publication Year: 2010, Page(s):5547 - 5567
Cited by:  Papers (88)
| | PDF (987 KB) | HTML

In this paper, we consider a class of restless multiarmed bandit processes (RMABs) that arises in dynamic multichannel access, user/server scheduling, and optimal activation in multiagent systems. For this class of RMABs, we establish the indexability and obtain Whittle index in closed form for both discounted and average reward criteria. These results lead to a direct implementation of Whittle in... View full abstract»

• ### A Cross-Layer View of Optimal Scheduling

Publication Year: 2010, Page(s):5568 - 5580
Cited by:  Papers (7)
| | PDF (702 KB) | HTML

The problem of joint scheduling and rate control for multicast traffic in wireless networks is considered under the performance objectives of sum throughput maximization and proportional fairness. Our results are also valid for the special cases of unicast and broadcast traffic. First, the problem of maximizing the sum throughput of the network is studied and an optimal scheduling and rate control... View full abstract»

• ### Superiority of Superposition Multiaccess With Single-User Decoding Over TDMA in the Low SNR Regime

Publication Year: 2010, Page(s):5581 - 5589
| | PDF (211 KB) | HTML

This paper studies the Gaussian multiaccess channel with multiantenna basestation in the low signal to noise ratio (SNR) regime. We compare the spectral efficiencies of the optimal superposition channel sharing scheme and two simple alternatives: the time division multiaccess (TDMA) scheme and superposition multiaccess with single-user decoding (SSD). Due to the fact that SSD, but not TDMA, exploi... View full abstract»

• ### Tight Bounds on the Capacity of Binary Input Random CDMA Systems

Publication Year: 2010, Page(s):5590 - 5613
Cited by:  Papers (19)
| | PDF (524 KB) | HTML

In this paper, we consider code-division multiple-access (CDMA) communication over a binary input additive white Gaussian noise (AWGN) channel using random spreading. For a general class of symmetric distributions for spreading sequences, in the limit of a large number of users, we prove an upper bound to the capacity. The bound matches the formula obtained by Tanaka using the replica method. We a... View full abstract»

• ### A Theoretical Framework for LMS MIMO Communication Systems Performance Analysis

Publication Year: 2010, Page(s):5614 - 5630
Cited by:  Papers (18)
| | PDF (879 KB) | HTML

A statistical model for Land Mobile Satellite (LMS) channels, where transmitters and receivers are equipped with multiple antennas, is introduced. Several spectral statistics are given, which allow the theoretical performance analysis of the newly proposed channel model from both a communication and an information-theoretic point of view. Specifically, joint and marginal statistics of the squared ... View full abstract»

• ### Coded Modulation With Mismatched CSIT Over MIMO Block-Fading Channels

Publication Year: 2010, Page(s):5631 - 5640
Cited by:  Papers (6)
| | PDF (482 KB) | HTML

Reliable communication over delay-constrained multiple-input multiple-output (MIMO) block-fading channels with discrete inputs and mismatched (imperfect) channel state information at the transmitter (CSIT) is studied. The CSIT mismatch is modeled as Gaussian random variables, whose variances decay as a power of the signal-to-noise ratio (SNR). A special focus is placed on the large-SNR decay of th... View full abstract»

• ### Joint Physical Layer Coding and Network Coding for Bidirectional Relaying

Publication Year: 2010, Page(s):5641 - 5654
Cited by:  Papers (210)
| | PDF (454 KB) | HTML

We consider a communication system where two transmitters wish to exchange information through a central relay. The transmitter and relay nodes exchange data over synchronized, average power constrained additive white Gaussian noise channels with a real input with signal-to-noise ratio (SNR) of snr. An upper bound on the capacity is 1/2 log(1 + snr) bits per transmitter per use of the multiple acc... View full abstract»

• ### An MGF-Based Unified Framework to Determine the Joint Statistics of Partial Sums of Ordered Random Variables

Publication Year: 2010, Page(s):5655 - 5672
Cited by:  Papers (13)
| | PDF (645 KB) | HTML

Order statistics find applications in various areas of communications and signal processing. In this paper, we introduce an unified analytical framework to determine the joint statistics of partial sums of ordered random variables (RVs). With the proposed approach, we can systematically derive the joint statistics of any partial sums of ordered statistics, in terms of the moment generating functio... View full abstract»

• ### Optimal Error Correction for Computationally Bounded Noise

Publication Year: 2010, Page(s):5673 - 5680
Cited by:  Papers (3)
| | PDF (170 KB) | HTML

For adversarial but computationally bounded models of error, we construct appealingly simple and efficient cryptographic encoding and unique decoding schemes whose error-correction capability is much greater than classically possible. In particular: 1) For binary alphabets, we construct positive-rate coding schemes that are uniquely decodable under a 1/2 - γ error rate for any constant �... View full abstract»

• ### A Lower Bound on List Size for List Decoding

Publication Year: 2010, Page(s):5681 - 5688
Cited by:  Papers (7)
| | PDF (233 KB) | HTML

A q-ary error-correcting code C ⊆ {1,2,...,q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords of C. We prove that in order for a q -ary code to be list-decodable up to radius (1-1/q)(1- ε)n, we must have L = Ω(1/ &... View full abstract»

• ### Grassmannian Packings From Operator Reed–Muller Codes

Publication Year: 2010, Page(s):5689 - 5714
Cited by:  Papers (13)
| | PDF (832 KB) | HTML

This paper introduces multidimensional generalizations of binary Reed-Muller codes where the codewords are projection operators, and the corresponding subspaces are widely separated with respect to the chordal distance on Grassmannian space. Parameters of these Grassmannian packings are derived and a low complexity decoding algorithm is developed by modifying standard decoding algorithms for binar... View full abstract»

• ### Error Correcting Coding for a Nonsymmetric Ternary Channel

Publication Year: 2010, Page(s):5715 - 5729
Cited by:  Papers (1)
| | PDF (441 KB) | HTML

Ternary channels can be used to model the behavior of some memory devices, where information is stored in three different levels. In this paper, error correcting coding for a ternary channel where some of the error transitions are not allowed, is considered. The resulting channel is nonsymmetric, therefore, classical linear codes are not optimal for this channel. We define the maximum-likelihood (... View full abstract»

## 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu