# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 41

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

Publication Year: 2009, Page(s): C2
| PDF (41 KB)
• ### Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams

Publication Year: 2009, Page(s):2909 - 2919
Cited by:  Papers (78)
| | PDF (241 KB) | HTML

Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can play a key role for solving coding problems in the projective space. In this paper, we propose a method to design error-correcting codes in the projective space. We use a multilevel approach to design our codes. F... View full abstract»

• ### A MacWilliams Identity for Convolutional Codes: The General Case

Publication Year: 2009, Page(s):2920 - 2930
Cited by:  Papers (8)
| | PDF (270 KB) | HTML

A MacWilliams identity for convolutional codes will be established. It makes use of the weight adjacency matrices of the code and its dual, based on state space realizations (the controller canonical form) of the codes in question. The MacWilliams identity applies to various notions of duality appearing in the literature on convolutional coding theory. View full abstract»

• ### Error-Correcting Codes for Automatic Control

Publication Year: 2009, Page(s):2931 - 2941
Cited by:  Papers (14)
| | PDF (257 KB) | HTML

Systems with automatic feedback control may consist of several remote devices, connected only by unreliable communication channels. It is necessary in these conditions to have a method for accurate, real-time state estimation in the presence of channel noise. This problem is addressed, for the case of polynomial-growth-rate state spaces, through a new type of error-correcting code that is online a... View full abstract»

• ### On the Pairwise Error Probability of Linear Programming Decoding on Independent Rayleigh Flat-Fading Channels

Publication Year: 2009, Page(s):2942 - 2955
| | PDF (423 KB) | HTML

In this paper, we consider the pairwise error probability (PEP) of a linear programming (LP) decoder for a general binary linear code as formulated by Feldman et al. (IEEE Trans. Inf. Theory, Mar. 2005) on an independent (or memoryless) Rayleigh flat-fading channel with coherent detection and perfect channel state information (CSI) at the receiver. Let H be a parity-check matrix of a binary linear... View full abstract»

• ### On Universal Properties of Capacity-Approaching LDPC Code Ensembles

Publication Year: 2009, Page(s):2956 - 2990
Cited by:  Papers (25)
| | PDF (957 KB) | HTML

This paper is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels. Properties of the degree distributions, graphical complexity, and the number of fundamental cycles in the bipartite graphs are considered via the derivation of infor... View full abstract»

• ### Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs

Publication Year: 2009, Page(s):2991 - 3012
Cited by:  Papers (40)
| | PDF (735 KB) | HTML

Interleaved Reed-Solomon codes are applied in numerous data processing, data transmission, and data storage systems. They are generated by interleaving several codewords of ordinary Reed-Solomon codes. Usually, these codewords are decoded independently by classical algebraic decoding methods. However, by collaborative algebraic decoding approaches, such interleaved schemes allow the correction of ... View full abstract»

• ### Near-Capacity Dirty-Paper Code Design: A Source-Channel Coding Approach

Publication Year: 2009, Page(s):3013 - 3031
Cited by:  Papers (34)
| | PDF (2224 KB) | HTML

This paper examines near-capacity dirty-paper code designs based on source-channel coding. We first point out that the performance loss in signal-to-noise ratio (SNR) in our code designs can be broken into the sum of the packing loss from channel coding and a modulo loss, which is a function of the granular loss from source coding and the target dirty-paper coding rate (or SNR). We then examine pr... View full abstract»

• ### Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region

Publication Year: 2009, Page(s):3032 - 3050
Cited by:  Papers (244)  |  Patents (1)
| | PDF (891 KB) | HTML

Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two-user Gaussian interference channel within one bit. In this paper, we develop new, improved outer bounds on the capacity region. Using these bounds, we show that <i>treating</i&g... View full abstract»

• ### Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels

Publication Year: 2009, Page(s):3051 - 3073
Cited by:  Papers (1195)  |  Patents (26)
| | PDF (707 KB) | HTML

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel (B-DMC) W. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. Channel polarization refers to the fact that it is possible to synthesize, out of N ind... View full abstract»

• ### A Simple Converse of Burnashev's Reliability Function

Publication Year: 2009, Page(s):3074 - 3080
Cited by:  Papers (26)
| | PDF (161 KB) | HTML

In a remarkable paper published in 1976, Burnashev determined the reliability function of variable-length block codes over discrete memoryless channels (DMCs) with feedback. Subsequently, an alternative <i>achievability</i> proof was obtained by Yamamoto and Itoh via a particularly simple and instructive scheme. Their idea is to alternate between a communication and a confirmation phas... View full abstract»

• ### Ordering Finite-State Markov Channels by Mutual Information

Publication Year: 2009, Page(s):3081 - 3086
Cited by:  Papers (1)
| | PDF (139 KB) | HTML

In this paper, an ordering result is given for Markov channels with respect to mutual information, under the assumption of an independent and identically distributed (i.i.d.) input distribution. For those Markov channels in which the capacity-achieving input distribution is i.i.d., this allows ordering of the channels by capacity. The complexity of analyzing general Markov channels is mitigated by... View full abstract»

• ### Universal Models for the Exponential Distribution

Publication Year: 2009, Page(s):3087 - 3090
Cited by:  Papers (9)
| | PDF (110 KB) | HTML

This paper considers the problem of constructing information theoretic universal models for data distributed according to the exponential distribution. The universal models examined include the sequential normalized maximum likelihood (SNML) code, conditional normalized maximum likelihood (CNML) code, the minimum message length (MML) code, and the Bayes mixture code (BMC). The CNML code yields a c... View full abstract»

• ### New Bounds for the Generalized Marcum$Q$-Function

Publication Year: 2009, Page(s):3091 - 3100
Cited by:  Papers (25)
| | PDF (263 KB) | HTML

In this paper, we study the generalized MarcumQ-functionQnu(a,b), wherea, nu > 0 andbges 0. Our aim is to extend the results of Corazza and Ferrari (IEEETrans.Inf.Theory, vol. 48, pp. 3003-3008, 2002) to the generalized MarcumQ-function in order to deduce some new tight lower and upper bounds. The key tools ... View full abstract»

• ### Space–Time Codes Achieving the DMD Tradeoff of the MIMO-ARQ Channel

Publication Year: 2009, Page(s):3101 - 3114
Cited by:  Papers (8)
| | PDF (437 KB) | HTML

For the quasi-static, Rayleigh-fading multiple-input multiple-output (MIMO) channel withnttransmit andnrreceive antennas, Zheng and Tse showed that there exists a fundamental tradeoff between diversity and spatial-multiplexing gains, referred to as the diversity-multiplexing gain (D-MG) tradeoff. Subsequently, El Gamal, Caire, and Damen considered signaling acro... View full abstract»

• ### Asymptotic Behavior of Random Vandermonde Matrices With Entries on the Unit Circle

Publication Year: 2009, Page(s):3115 - 3147
Cited by:  Papers (28)
| | PDF (871 KB) | HTML

Analytical methods for finding moments of random Vandermonde matrices with entries on the unit circle are developed. Vandermonde matrices play an important role in signal processing and wireless applications such as direction of arrival estimation, precoding, and sparse sampling theory, just to name a few. Within this framework, we extend classical freeness results on random matrices with independ... View full abstract»

• ### On Randomized Linear Network Codes and Their Error Correction Capabilities

Publication Year: 2009, Page(s):3148 - 3160
Cited by:  Papers (30)
| | PDF (297 KB) | HTML

Randomized linear network code for single source multicast was introduced and analyzed in Ho et al. (IEEE Transactions on Information Theory, October 2006) where the main results are upper bounds for the failure probability of the code. In this paper, these bounds are improved and tightness of the new bounds is studied by analyzing the limiting behavior of the failure probability as the field size... View full abstract»

• ### D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Publication Year: 2009, Page(s):3161 - 3185
Cited by:  Papers (38)
| | PDF (613 KB) | HTML

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), nonorthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time (ST) code constructions are provided. The codes constructed a... View full abstract»

• ### Coding and Decoding for the Dynamic Decode and Forward Relay Protocol

Publication Year: 2009, Page(s):3186 - 3205
Cited by:  Papers (27)
| | PDF (1702 KB) | HTML

We study the dynamic decode-and-forward (DDF) protocol for a single half-duplex relay, single-antenna channel with quasi-static fading. The DDF protocol is well known and has been analyzed in terms of the diversity-multiplexing tradeoff (DMT) in the infinite block length limit. We characterize the finite block length DMT and give new explicit code constructions. The finite block length analysis il... View full abstract»

• ### Cooperative Multicell Zero-Forcing Beamforming in Cellular Downlink Channels

Publication Year: 2009, Page(s):3206 - 3219
Cited by:  Papers (88)  |  Patents (2)
| | PDF (377 KB) | HTML

In this work, a multicell cooperative zero-forcing beamforming (ZFBF) scheme combined with a simple user selection procedure is considered for the Wyner cellular downlink channel. The approach is to transmit to the user with the ldquobestrdquo local channel in each cell. The performance of this suboptimal scheme is investigated in terms of the conventional sum-rate scaling law and the sum-rate off... View full abstract»

• ### Energy Efficiency-Delay Tradeoffs in CDMA Networks: A Game-Theoretic Approach

Publication Year: 2009, Page(s):3220 - 3228
Cited by:  Papers (21)
| | PDF (644 KB) | HTML

A game-theoretic approach for studying energy efficiency-delay tradeoffs in multiple-access networks is proposed. Focusing on the uplink of a code-division multiple-access (CDMA) network, a noncooperative game is considered in which each user seeks to choose a transmit power that maximizes its own utility while satisfying its (transmission) delay requirements. The utility function measures the num... View full abstract»

• ### Random Projection Trees for Vector Quantization

Publication Year: 2009, Page(s):3229 - 3242
Cited by:  Papers (46)
| | PDF (426 KB) | HTML

A simple and computationally efficient scheme for tree-structured vector quantization is presented. Unlike previous methods, its quantization error depends only on the intrinsic dimension of the data distribution, rather than the apparent dimension of the space in which the data happen to lie. View full abstract»

• ### On the Uniform Quantization of a Class of Sparse Sources

Publication Year: 2009, Page(s):3243 - 3263
Cited by:  Papers (16)
| | PDF (492 KB) | HTML

We consider the uniform scalar quantization of a class of mixed distributed memoryless sources, namely sources having a Bernoulli Generalized Gaussian (BGG) distribution. Both for low and high resolutions, asymptotic expressions of the distortion for a pth-order moment error measure, and close approximations of the entropy are provided for these sources. Operational rate-distortion functions at hi... View full abstract»

• ### Random-Coding Lower Bounds for the Error Exponent of Joint Quantization and Watermarking Systems

Publication Year: 2009, Page(s):3264 - 3283
| | PDF (507 KB) | HTML

We establish random-coding lower bounds to the error exponent of discrete and Gaussian joint quantization and private watermarking systems. In the discrete system, both the covertext and the attack channel are memoryless and have finite alphabets. In the Gaussian system, the covertext is memoryless Gaussian and the attack channel has additive memoryless Gaussian noise. In both cases, our bounds on... 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