# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 40

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

Publication Year: 2007, Page(s): C2
| PDF (38 KB)
• ### Convolutional and Tail-Biting Quantum Error-Correcting Codes

Publication Year: 2007, Page(s):865 - 880
Cited by:  Papers (56)
| | PDF (462 KB) | HTML

Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F<sub>4</sub>-linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous q... View full abstract»

• ### Capacity of Time-Varying Channels With Causal Channel Side Information

Publication Year: 2007, Page(s):881 - 899
Cited by:  Papers (18)
| | PDF (453 KB) | HTML

We derive the capacity of time-varying channels with memory that have causal channel side information (CSI) at the sender and receiver. We obtain capacity of block-memoryless and asymptotically block-memoryless channels with block-memoryless or weakly decorrelating side information. Our coding theorems rely on causal generation of the codewords relative to the causal transmitter CSI. The CSI need ... View full abstract»

• ### Cooperative Relay Broadcast Channels

Publication Year: 2007, Page(s):900 - 928
Cited by:  Papers (142)
| | PDF (1095 KB) | HTML

The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into two-user broadcast channels to support user cooperation. In the first channel, the partially cooperative RBC, only one user in the system acts as a relay. An achievable rate region is derived based on the relay using the decode-and-forward scheme. An outer bound on the capacity re... View full abstract»

• ### On the Feedback Capacity of Power-Constrained Gaussian Noise Channels With Memory

Publication Year: 2007, Page(s):929 - 954
Cited by:  Papers (29)
| | PDF (693 KB) | HTML

For a stationary additive Gaussian-noise channel with a rational noise power spectrum of a finite-order L, we derive two new results for the feedback capacity under an average channel input power constraint. First, we show that a very simple feedback-dependent Gauss-Markov source achieves the feedback capacity, and that Kalman-Bucy filtering is optimal for processing the feedback. Based on these r... View full abstract»

• ### The Minimum Average Code for Finite Memoryless Monotone Sources

Publication Year: 2007, Page(s):955 - 975
Cited by:  Papers (14)
| | PDF (960 KB) | HTML

The problem of selecting a code for finite monotone sources with N symbols is considered. The selection criterion is based on minimizing the average redundancy (called Minave criterion) instead of its maximum (i.e., Minimax criterion). The average probability distribution P<sup>Nmacr</sup>, whose associated Huffman code has the minimum average redundancy, is derived. The entropy of the... View full abstract»

• ### Channel Coherence in the Low-SNR Regime

Publication Year: 2007, Page(s):976 - 997
Cited by:  Papers (81)
| | PDF (657 KB) | HTML

Channel capacity in the limit of vanishing signal-to-noise ratio (SNR) per degree of freedom is known to be linear in SNR for fading and nonfading channels, regardless of channel state information at the receiver (CSIR). It has recently been shown that the significant engineering difference between the coherent and the noncoherent fading channels, including the requirement of peaky signaling and t... View full abstract»

• ### Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity

Publication Year: 2007, Page(s):998 - 1008
Cited by:  Papers (51)
| | PDF (286 KB) | HTML

We consider a slotted system with N queues, and independent and identically distributed (i.i.d.) Bernoulli arrivals at each queue during each slot. Each queue is associated with a channel that changes between "on" and "off" states according to i.i.d. Bernoulli processes. We assume that the system has K identical transmitters ("servers"). Each server, during each slot, can transmit up to C packets ... View full abstract»

• ### Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

Publication Year: 2007, Page(s):1009 - 1018
Cited by:  Papers (421)  |  Patents (2)
| | PDF (759 KB) | HTML

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same 1/radicn transmission rate of arbitrarily located nodes. This contrasts with previous results suggesting that a 1/radicnlogn reduced rate ... View full abstract»

• ### Stationary Random Fields in Space and Time With Rational Spectral Densities

Publication Year: 2007, Page(s):1019 - 1029
Cited by:  Papers (9)
| | PDF (541 KB) | HTML

This paper introduces three spatio-temporal stationary random fields with simple correlation functions and rational spectral densities. The correlation functions have similar forms, but are defined on different space-time domains or related to different spatial norms. Positive and negative correlations are allowed, and the domain of certain model parameters may rely on the spatial dimensional para... View full abstract»

• ### Mixing and Non-Mixing Local Minima of the Entropy Contrast for Blind Source Separation

Publication Year: 2007, Page(s):1030 - 1042
Cited by:  Papers (17)
| | PDF (823 KB) | HTML

In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable and spurious solutions of the BSS problem. The contribution of this work is twofold. First, a Taylor development is used to show that the exact output entropy cost function has a non-mixing minimum when this output is pro... View full abstract»

• ### An Inequality for Nearly Log-Concave Distributions With Applications to Learning

Publication Year: 2007, Page(s):1043 - 1057
Cited by:  Papers (3)
| | PDF (474 KB) | HTML

We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these sets is large. We apply this isoperimetric inequality to derive lower bounds on the generalization error in learning. We further consider regression problems and show that if the inputs and outputs are sampled from a nearly log-conca... View full abstract»

• ### Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints

Publication Year: 2007, Page(s):1058 - 1079
Cited by:  Papers (36)
| | PDF (1097 KB) | HTML

In this paper, we consider the design and analysis of generalized low-density parity-check (GLDPC) codes in AWGN channels. The GLDPC codes are specified by a bipartite Tanner graph, as with standard LDPC codes, but with the single parity-check constraints replaced by general coding constraints. In particular, we consider imposing Hadamard code constraints at the check nodes for a low-rate approach... View full abstract»

• ### TS-LDPC Codes: Turbo-Structured Codes With Large Girth

Publication Year: 2007, Page(s):1080 - 1094
Cited by:  Papers (10)
| | PDF (2244 KB) | HTML

We consider turbo-structured low-density parity-check (TS-LDPC) codes-structured regular codes whose Tanner graph is composed of two trees connected by an interleaver. TS-LDPC codes with good girth properties are easy to construct: careful design of the interleaver component prevents short cycles of any desired length in its Tanner graph. We present algorithms to construct TS-LDPC codes with arbit... View full abstract»

• ### General Error Locator Polynomials for Binary Cyclic Codes With $t \le 2$ and $n < 63$

Publication Year: 2007, Page(s):1095 - 1107
Cited by:  Papers (23)
| | PDF (441 KB) | HTML

In this paper, we show that a recently proposed algorithm for decoding cyclic codes may be applied efficiently to all binary cyclic codes with tles2 and n<63. This is accomplished by providing structure theorems for the codes in this range and classifying the relevant cases View full abstract»

• ### Throughput and Delay in Random Wireless Networks With Restricted Mobility

Publication Year: 2007, Page(s):1108 - 1116
Cited by:  Papers (72)
| | PDF (481 KB) | HTML

Grossglauser and Tse (2001) introduced a mobile random network model where each node moves independently on a unit disk according to a stationary uniform distribution and showed that a throughput of Theta(1) is achievable. El Gamal, Mammen, Prabhakar, and Shah (2004) showed that the delay associated with this throughput scales as Theta(nlogn), when each node moves according to an independent rando... View full abstract»

• ### CDMA Systems With Correlated Spatial Diversity: A Generalized Resource Pooling Result

Publication Year: 2007, Page(s):1116 - 1136
Cited by:  Papers (9)
| | PDF (903 KB) | HTML

This correspondence analyzes the behavior of code-division multiple-access (CDMA) systems with correlated spatial diversity. The users transmit to one or more antenna arrays. The centralized receiver employs a linear multiuser detector. We derive the performance of a large system with random spreading sequences and weak assumptions on the flat-fading channel gains-the fading may be correlated and ... View full abstract»

• ### Blind OFDM Channel Estimation Using FIR Constraints: Reduced Complexity and Identifiability

Publication Year: 2007, Page(s):1136 - 1147
Cited by:  Papers (1)  |  Patents (3)
| | PDF (3499 KB) | HTML

In this correspondence, blind channel estimators exploiting finite alphabet constraints are discussed for orthogonal frequency-division multiplexing (OFDM) systems. Considering the channel and data jointly, a joint maximum-likelihood (JML) algorithm is described, along with identifiability conditions in the noise-free case. This approach enables development of general identifiability conditions fo... View full abstract»

• ### Asymptotic Performance of Reduced-Rank Linear Receivers With Principal Component Filter

Publication Year: 2007, Page(s):1148 - 1151
Cited by:  Papers (1)
| | PDF (219 KB) | HTML

This correspondence studies the asymptotic performance of output signal-to-interference-plus-noise ratio (SINR) for reduced-rank linear receivers with principal component filter. We prove that for code division multiple access (CDMA) systems with random spreading codes, when the number of users and the spreading gain go to infinity with their ratio being fixed, the output SINR converges to a fixed... View full abstract»

• ### Accurate Approximation of QAM Error Probability on Quasi-Static MIMO Channels and Its Application to Adaptive Modulation

Publication Year: 2007, Page(s):1151 - 1160
Cited by:  Papers (4)
| | PDF (1799 KB) | HTML

An accurate approximation for the conditional error probability on quasi-static multiple-input multiple-output (MIMO) antenna channels is proposed. For a fixed channel matrix, it is possible to accurately predict the performance of quadrature amplitude modulations (QAM) transmitted over the MIMO channel in presence of additive white Gaussian noise. The tight approximation is based on a simple Unio... View full abstract»

• ### Information-Bearing Noncoherently Modulated Pilots for MIMO Training

Publication Year: 2007, Page(s):1160 - 1168
Cited by:  Papers (2)
| | PDF (2643 KB) | HTML

In this correspondence, we deal with noncoherent communications over multiple-input-multiple-output (MIMO) wireless links. For a Rayleigh flat block-fading channel with M transmit- and N receive-antennas and a channel coherence interval of length T, it is well known that for TGtM, or, at high signal-to-noise-ratio (SNR) rhoGt1 and Mlesmin{N,lfloorT/2rfloor}, unitary space-time modulation (USTM) is... View full abstract»

• ### On the Elementwise Convergence of Continuous Functions of Hermitian Banded Toeplitz Matrices

Publication Year: 2007, Page(s):1168 - 1176
Cited by:  Papers (9)
| | PDF (465 KB) | HTML

Toeplitz matrices and functions of Toeplitz matrices (such as the inverse of a Toeplitz matrix, powers of a Toeplitz matrix or the exponential of a Toeplitz matrix) arise in many different theoretical and applied fields. They can be found in the mathematical modeling of problems where some kind of shift invariance occurs in terms of space or time. R. M. Gray's excellent tutorial monograph on Toepl... View full abstract»

• ### Low-Resolution Scalar Quantization for Gaussian Sources and Absolute Error

Publication Year: 2007, Page(s):1177 - 1179
Cited by:  Papers (4)
| | PDF (166 KB) | HTML

This correspondence considers low-resolution scalar quantization for a memoryless Gaussian source with respect to absolute error distortion. It shows that slope of the operational rate-distortion function of scalar quantization is infinite at the point D<sub>max</sub> where the rate becomes zero. Thus, unlike the situation for squared error distortion, or for Laplacian and exponential ... View full abstract»

• ### On Divergence-Power Inequalities

Publication Year: 2007, Page(s):1179 - 1182
Cited by:  Papers (2)
| | PDF (201 KB) | HTML

Expressions for (entropy-power inequality (EPI) Shannon type) divergence-power inequalities (DPIs) in two cases (time-discrete and time-continuous) of stationary random processes are given. The new expressions connect the divergence rate of the sum of independent processes, the individual divergence rate of each process, and their power spectral densities. All divergences are between a process and... 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