# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 55

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

Publication Year: 2008, Page(s): C2
| PDF (38 KB)
• ### IEEE Transactions on Information Theory Associate Editors

Publication Year: 2008, Page(s): 1
| PDF (33 KB)
• ### 2007 IEEE Information Theory Society Paper Award

Publication Year: 2008, Page(s):2 - 3
| PDF (862 KB)
• ### 2007 IEEE Communications Society and Information Theory Society Joint Paper Award

Publication Year: 2008, Page(s): 4
| PDF (254 KB)
• ### Improved Upper Bounds on the Reliability Function of the Gaussian Channel

Publication Year: 2008, Page(s):5 - 12
Cited by:  Papers (5)
| | PDF (227 KB) | HTML

A new lower bound on the distance distribution of spherical codes is derived. This yields two new upper bounds on the reliability function of the Gaussian channel. These bounds outperform previously known bounds, and imply a new range of rates for which the exact value of the reliability function is known. View full abstract»

• ### An Improved Bound on the List Error Probability and List Distance Properties

Publication Year: 2008, Page(s):13 - 32
Cited by:  Papers (5)
| | PDF (731 KB) | HTML

List decoding of binary block codes for the additive white Gaussian noise (AWGN) channel is considered. The output of a list decoder is a list of the most likely codewords, that is, the signal points closest to the received signal in the Euclidean-metric sense. A decoding error occurs when the transmitted codeword is not on this list. It is shown that the list error probability is fully described ... View full abstract»

• ### Diversity Embedded Space–Time Codes

Publication Year: 2008, Page(s):33 - 50
Cited by:  Papers (32)
| | PDF (1332 KB) | HTML

Rate and diversity impose a fundamental tradeoff in wireless communication. High-rate space-time codes come at a cost of lower reliability (diversity), and high reliability (diversity) implies a lower rate. However, wireless networks need to support applications with very different quality-of-service (QoS) requirements, and it is natural to ask what characteristics should be built into the physica... View full abstract»

• ### Extremal Problems of Information Combining

Publication Year: 2008, Page(s):51 - 71
Cited by:  Papers (4)
| | PDF (658 KB) | HTML

In this paper, we study moments of soft bits of binary-input symmetric-output channels and solve some extremal problems of the moments. We use these results to solve the extremal information combining problem. Further, we extend the information combining problem by adding a constraint on the second moment of soft bits, and find the extremal distributions for this new problem. The results for this ... View full abstract»

• ### Capacity Bounds for Sticky Channels

Publication Year: 2008, Page(s):72 - 77
Cited by:  Papers (27)
| | PDF (172 KB) | HTML

The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight numerical upper and lower bounds for the independent and identically distributed (i.i.d.) duplication channel. View full abstract»

• ### Effect of Random Permutation of Symbols in a Sequence

Publication Year: 2008, Page(s):78 - 86
Cited by:  Papers (1)
| | PDF (220 KB) | HTML

An operation that permutes symbols in a sequence is used for several coding algorithms. The probability distribution of the permuted source is investigated, where the permutation is selected at random with a uniform distribution. Moreover, the entropy of the permuted source and the mutual information shared by the original and permuted sources are derived. View full abstract»

• ### Linear Precoders for Bit-Interleaved Coded Modulation on AWGN Channels: Analysis and Design Criteria

Publication Year: 2008, Page(s):87 - 99
Cited by:  Papers (6)
| | PDF (748 KB) | HTML

This paper investigates linear precoding for bit-interleaved coded modulation (BICM) on additive white Gaussian noise (AWGN) channels. Concatenating a linear precoder as an inner encoder with an outer (convolutional) encoder produces a powerful code with a limited decoding complexity. Linear precoders are examined and optimized for two scenarios: using (i) a noniterative decoding strategy and (ii)... View full abstract»

Publication Year: 2008, Page(s):100 - 115
Cited by:  Papers (25)
| | PDF (401 KB) | HTML

We consider transmission over the ergodic fading multiple-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent non-fading channel, capacity has recently been shown to be achievable using transmission schemes that were designed for the "dirty paper" channel. We focus on a similar "fading paper" model.... View full abstract»

• ### Joint Source–Channel Codes for MIMO Block-Fading Channels

Publication Year: 2008, Page(s):116 - 134
Cited by:  Papers (73)  |  Patents (1)
| | PDF (525 KB) | HTML

We consider transmission of a continuous amplitude source over an L-block Rayleigh-fading Mt x Mr multiple-input multiple-output (MIMO) channel when the channel state information is only available at the receiver. Since the channel is not ergodic, Shannon's source-channel separation theorem becomes obsolete and the optimal performance requires a joint source-channel approach.... View full abstract»

• ### Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy

Publication Year: 2008, Page(s):135 - 150
Cited by:  Papers (41)  |  Patents (1)
| | PDF (449 KB) | HTML

In this paper, we present error-correcting codes that achieve the information-theoretically best possible tradeoff between the rate and error-correction radius. Specifically, for every 0 < R < 1 and epsiv < 0, we present an explicit construction of error-correcting codes of rate that can be list decoded in polynomial time up to a fraction (1- R - epsiv) of worst-case errors. At least theo... View full abstract»

• ### Degrees of Freedom Region of the MIMO $X$ Channel

Publication Year: 2008, Page(s):151 - 170
Cited by:  Papers (459)  |  Patents (2)
| | PDF (452 KB) | HTML

We provide achievability as well as converse results for the degrees of freedom region of a multiple-input multiple-output (MIMO) X channel, i.e., a system with two transmitters, two receivers, each equipped with multiple antennas, where independent messages need to be conveyed over fixed channels from each transmitter to each receiver. The inner and outer bounds on the degrees of freedom region a... View full abstract»

• ### Interference Channels With Common Information

Publication Year: 2008, Page(s):171 - 187
Cited by:  Papers (34)
| | PDF (453 KB) | HTML

In this paper, the interference channel with common information (ICC), in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers, is investigated. An achievable rate region for such a channel is obtained by applying a superposition coding scheme that consists of successive encoding and simultaneous decoding. It is shown that the d... View full abstract»

• ### Exponential Diversity Achieving Spatio–Temporal Power Allocation Scheme for Fading Channels

Publication Year: 2008, Page(s):188 - 208
Cited by:  Papers (31)
| | PDF (967 KB) | HTML

In this paper, we analyze optimal (in space and time) adaptive power transmission policies for fading channels when the channel-state information (CSI) at the transmitter (CSIT) and the receiver (CSIR) is available. The transmitter has a long-term (time) average power constraint. There can be multiple antennas at the transmitter and at the receiver. The channel experiences Rayleigh fading. We cons... View full abstract»

• ### Linear Network Error Correction Codes in Packet Networks

Publication Year: 2008, Page(s):209 - 218
Cited by:  Papers (77)
| | PDF (249 KB) | HTML

In this paper, we study basic properties of linear network error correction codes, their construction and error correction capability for various kinds of errors. Our discussion is restricted to the single-source multicast case. We define the minimum distance of a network error correction code. This plays the same role as it does in classical coding theory. We construct codes that can correct erro... View full abstract»

• ### Locally Optimum Detection of Signals in Multiplicative and First-Order Markov Additive Noises

Publication Year: 2008, Page(s):219 - 234
Cited by:  Papers (5)
| | PDF (622 KB) | HTML

In most previously reported studies on locally optimum detection of signals, independent observations have been assumed in various noise environments. The use of an independent observation model may cause a considerable performance degradation in detection applications of modern high data-rate communication systems exhibiting dependence among interference components. In this paper, the detection o... View full abstract»

• ### State Estimation With Initial State Uncertainty

Publication Year: 2008, Page(s):235 - 254
Cited by:  Papers (2)
| | PDF (742 KB) | HTML

The problem of state estimation with initial state uncertainty is approached from a statistical decision theory point of view. The initial state is regarded as deterministic and unknown. It is only known that the initial state vector belongs to a specified parameter set. The (frequentist) risk is considered as the performance measure and the minimax approach is adopted. Minimax estimators are deri... View full abstract»

• ### Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources

Publication Year: 2008, Page(s):255 - 274
Cited by:  Papers (35)
| | PDF (510 KB) | HTML

An information-theoretic approach is proposed to watermark embedding and detection under limited detector resources. First, the attack-free scenario is considered under which asymptotically optimal decision regions in the Neyman-Pearson sense are proposed, along with the optimal embedding rule. Later, the case of zero-mean independent and identically distributed (i.i.d.) Gaussian covertext distrib... View full abstract»

• ### Graph-Based Semi-Supervised Learning and Spectral Kernel Design

Publication Year: 2008, Page(s):275 - 288
Cited by:  Papers (32)
| | PDF (470 KB) | HTML

In this paper, we consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised learning methods on graphs. We examine various theoretical properties of such methods. In particular, we present learning bounds and derive optimal kernel representation by minimizing the bound. Based on th... View full abstract»

• ### Asymptotic Minimax Bounds for Stochastic Deconvolution Over Groups

Publication Year: 2008, Page(s):289 - 298
Cited by:  Papers (11)
| | PDF (267 KB) | HTML

This paper examines stochastic deconvolution over noncommutative compact Lie groups. This involves Fourier analysis on compact Lie groups as well as convolution products over such groups. An observation process consisting of a known impulse response function convolved with an unknown signal with additive white noise is assumed. Data collected through the observation process then allow us to constr... View full abstract»

• ### Achievable Rates for Pattern Recognition

Publication Year: 2008, Page(s):299 - 320
Cited by:  Papers (26)
| | PDF (884 KB) | HTML

Biological and machine pattern recognition systems face a common challenge: Given sensory data about an unknown pattern, classify the pattern by searching for the best match within a library of representations stored in memory. In many cases, the number of patterns to be discriminated and the richness of the raw data force recognition systems to internally represent memory and sensory information ... 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