# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 40

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

Publication Year: 2009, Page(s): C2
| PDF (42 KB)
• ### Interference Alignment and the Degrees of Freedom of Wireless $X$ Networks

Publication Year: 2009, Page(s):3893 - 3908
Cited by:  Papers (237)  |  Patents (3)
| | PDF (988 KB) | HTML

We explore the degrees of freedom of M times N user wireless X networks, i.e., networks of M transmitters and N receivers where every transmitter has an independent message for every receiver. We derive a general outer bound on the degrees of freedom region of these networks. When all nodes have a single antenna and all channel coefficients vary in time or frequency, we show that the total ... View full abstract»

• ### Cooperative Multiplexing: Toward Higher Spectral Efficiency in Multiple-Antenna Relay Networks

Publication Year: 2009, Page(s):3909 - 3926
Cited by:  Papers (11)
| | PDF (523 KB) | HTML

Previous work on cooperative communications has concentrated primarily on the diversity benefits of such techniques. This paper, instead, considers the multiplexing benefits of cooperative communications. First, a new interpretation on the fundamental tradeoff between the transmission rate and outage probability in multiple-antenna relay networks is given. It follows that multiplexing gains can be... View full abstract»

• ### Source and Channel Coding for Correlated Sources Over Multiuser Channels

Publication Year: 2009, Page(s):3927 - 3944
Cited by:  Papers (40)
| | PDF (336 KB) | HTML

Source and channel coding over multiuser channels in which receivers have access to correlated source side information are considered. For several multiuser channel models necessary and sufficient conditions for optimal separation of the source and channel codes are obtained. In particular, the multiple-access channel, the compound multiple-access channel, the interference channel, and the two-way... View full abstract»

• ### Cognitive Radio: An Information-Theoretic Perspective

Publication Year: 2009, Page(s):3945 - 3958
Cited by:  Papers (274)  |  Patents (3)
| | PDF (345 KB) | HTML

In this paper, we consider a communication scenario in which the primary and the cognitive radios wish to communicate to different receivers, subject to mutual interference. In the model that we use, the cognitive radio has noncausal knowledge of the primary radio's codeword. We characterize the largest rate at which the cognitive radio can reliably communicate under the constraint that 1) no View full abstract»

• ### On Capacity Scaling in Arbitrary Wireless Networks

Publication Year: 2009, Page(s):3959 - 3982
Cited by:  Papers (56)
| | PDF (581 KB) | HTML

In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., n nodes are placed uniformly at random in a square region of area n). They showed that for small path-loss exponents alpha isin (2,3], cooperative communication is order optimal, and for large path-loss exp... View full abstract»

• ### Parallel Gaussian Interference Channels Are Not Always Separable

Publication Year: 2009, Page(s):3983 - 3990
Cited by:  Papers (51)
| | PDF (244 KB) | HTML

It is known that the capacity of parallel (multicarrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. In this paper we show that such a separation does not apply to parallel Gaussian interference channels in general. A counterexample is provided in the form of a 3 us... View full abstract»

• ### Rate Region of Gaussian Multiple Description Coding With Individual and Central Distortion Constraints

Publication Year: 2009, Page(s):3991 - 4005
Cited by:  Papers (22)  |  Patents (1)
| | PDF (351 KB) | HTML

The rate region of Gaussian multiple description coding with individual and central distortion constraints is completely characterized. Specifically, a lower bound and an upper bound are derived for each supporting hyperplane of the rate region, where the lower bound is associated with a max-min game while the upper bound is associated with a min-max game; furthermore, it is shown that these two b... View full abstract»

• ### On the Duality Between Slepian–Wolf Coding and Channel Coding Under Mismatched Decoding

Publication Year: 2009, Page(s):4006 - 4018
Cited by:  Papers (6)
| | PDF (304 KB) | HTML

In this paper, Slepian-Wolf coding with a mismatched decoding metric is studied. Two different dualities between Slepian-Wolf coding and channel coding under mismatched decoding are established. These two dualities provide a systematic framework for comparing linear Slepian-Wolf codes, nonlinear Slepian-Wolf codes, and variable-rate Slepian-Wolf codes. In contrast with the fact that linear codes s... View full abstract»

• ### Precoding for the AWGN Channel With Discrete Interference

Publication Year: 2009, Page(s):4019 - 4032
Cited by:  Papers (2)
| | PDF (407 KB) | HTML

For a state-dependent discrete memoryless channel with input alphabet X, state alphabet S, and output alphabet Y where the independent and identically distributed (i.i.d.) state sequence is known causally at the transmitter, it is shown that by using at most min{|X||S|-|S| + 1,|Y|} out of |X||S| inputs of the Shannon's derived channel, the capacity is achievable. As... View full abstract»

• ### Towards the Secrecy Capacity of the Gaussian MIMO Wire-Tap Channel: The 2-2-1 Channel

Publication Year: 2009, Page(s):4033 - 4039
Cited by:  Papers (161)
| | PDF (164 KB) | HTML

We find the secrecy capacity of the 2-2-1 Gaussian MIMO wiretap channel, which consists of a transmitter and a receiver with two antennas each, and an eavesdropper with a single antenna. We determine the secrecy capacity of this channel by proposing an achievable scheme and then developing a tight upper bound that meets the proposed achievable secrecy rate. We show that, for this channel, Gaussian... View full abstract»

• ### Optimality of Myopic Sensing in Multichannel Opportunistic Access

Publication Year: 2009, Page(s):4040 - 4050
Cited by:  Papers (173)  |  Patents (1)
| | PDF (230 KB) | HTML

This paper considers opportunistic communication over multiple channels where the state (ldquogoodrdquo or ldquobadrdquo) of each channel evolves as independent and identically distributed (i.i.d.) Markov processes. A user, with limited channel sensing capability, chooses one channel to sense and decides whether to use the channel (based on the sensing result) in each time slot. A reward is obtain... View full abstract»

• ### End-to-End Energy–Bandwidth Tradeoff in Multihop Wireless Networks

Publication Year: 2009, Page(s):4051 - 4066
Cited by:  Papers (54)
| | PDF (1726 KB) | HTML

In this paper, energy-constrained wireless multihop networks with a single source-destination pair are considered. A network model that incorporates both the energy radiated by the transmitter and the energy consumed by the circuits that process the received signals is proposed. The rate of communication is the number of information bits transmitted (end-to-end) per coded symbol transmitted by any... View full abstract»

• ### Interference and Outage in Clustered Wireless Ad Hoc Networks

Publication Year: 2009, Page(s):4067 - 4086
Cited by:  Papers (152)
| | PDF (1271 KB) | HTML

In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson cluster process on the plane. We derive the distributional properties of the interference and provide upper and lower bounds for its distribution. We consi... View full abstract»

• ### Queue Back-Pressure Random Access in Multihop Wireless Networks: Optimality and Stability

Publication Year: 2009, Page(s):4087 - 4098
Cited by:  Papers (27)
| | PDF (697 KB) | HTML

A model for wireless networks with slotted-Aloha-type random access and with multihop flow routes is considered. The goal is to devise distributed algorithms for utility-optimal end-to-end throughput allocation and queueing stability. A class of queue back-pressure random access algorithms (QBRAs), in which actual queue lengths of the flows in each node's close neighborhood are used to determine t... View full abstract»

• ### Analysis of Connections Between Pseudocodewords

Publication Year: 2009, Page(s):4099 - 4107
Cited by:  Papers (12)
| | PDF (234 KB) | HTML

The role of pseudocodewords in causing non-codeword outputs in linear programming decoding, graph cover decoding, and iterative message-passing decoding is investigated. The three main types of pseudocodewords in the literature-linear programming pseudocodewords, graph cover pseudocodewords, and computation tree pseudocodewords-are reviewed and connections between them are explored. Some discrepan... View full abstract»

• ### Error Exponents for Two Soft-Decision Decoding Algorithms of Reed–Muller Codes

Publication Year: 2009, Page(s):4108 - 4118
Cited by:  Papers (1)
| | PDF (281 KB) | HTML

Error exponents are studied for recursive and majority decoding of general Reed-Muller (RM) codes RM(r, m) used on the additive white Gaussian noise (AWGN) channels. Both algorithms have low complexity and correct many error patterns whose weight exceeds half the code distance. Decoding consists of multiple consecutive steps, which repeatedly recalculate the input symbols and determi... View full abstract»

• ### Rateless Coding for Arbitrary Channel Mixtures With Decoder Channel State Information

Publication Year: 2009, Page(s):4119 - 4133
Cited by:  Papers (10)
| | PDF (356 KB) | HTML

Rateless coding has recently been the focus of much practical as well as theoretical research. In this paper, rateless codes are shown to find a natural application in channels where the channel law varies unpredictably. Such unpredictability means that to ensure reliable communication block codes are limited by worst case channel variations. However, the dynamic decoding nature of rateless codes ... View full abstract»

• ### Linear-Programming Decoding of Nonbinary Linear Codes

Publication Year: 2009, Page(s):4134 - 4154
Cited by:  Papers (38)  |  Patents (1)
| | PDF (715 KB) | HTML

A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates LP-based reception for coded modulation systems which use direct modulation mapping of coded symbols. It is proved that the resulting LP decoder has the ldquomaximum-likelihood (ML) certificaterdquo property. It is also shown that the decoder output is the lowest cost pseu... View full abstract»

• ### Single-Exclusion Number and the Stopping Redundancy of MDS Codes

Publication Year: 2009, Page(s):4155 - 4166
Cited by:  Papers (4)
| | PDF (421 KB) | HTML

For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smaller than the minimum distance of C. Schwartz and Vardy conjectured that the stopping redundancy of a maximum-distance separable (MDS) code should only depend on its length and minimum distance. We define the (n, t)-single-ex... View full abstract»

• ### An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices

Publication Year: 2009, Page(s):4167 - 4178
Cited by:  Papers (29)
| | PDF (358 KB) | HTML

In this work, we introduce an efficient algorithm to find all stopping sets, of size less than some threshold, of a fixed low-density parity-check (LDPC) matrix. The solution is inspired by the algorithm proposed by Rosnes and Ytrehus in 2005 to find an exhaustive list of all small-size turbo stopping sets in a turbo code. The efficiency of the proposed algorithm is demonstrated by several numeric... View full abstract»

• ### List Decoding of Burst Errors

Publication Year: 2009, Page(s):4179 - 4190
Cited by:  Papers (4)
| | PDF (265 KB) | HTML

A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed-Solomon codes attain this bound. View full abstract»

• ### Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Correction

Publication Year: 2009, Page(s):4191 - 4203
Cited by:  Papers (3)
| | PDF (850 KB) | HTML

The coding technique that combines channel estimation and error correction has received attention recently, and has been regarded as a promising approach to counter the effects of multipath fading. It has been shown by simulation that a proper code design that jointly considers channel estimation can improve the system performance subject to a fixed code rate as compared to a conventional system w... View full abstract»

• ### Improvement of Gallager Upper Bound and its Variations for Discrete Channels

Publication Year: 2009, Page(s):4204 - 4210
| | PDF (222 KB) | HTML

A new tight upper bound on the maximum-likelihood (ML) word and bit-error decoding probabilities for specific codes over discrete channels is presented. It constitutes an enhanced version of the Gallager upper bound and its variations resulting from the Duman-Salehi second bounding technique. An efficient technique is developed that, in the case of symmetric channels, overcomes the difficulties as... 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
Prakash Narayan

Department of Electrical and Computer Engineering