# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 47

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

Publication Year: 2008, Page(s): C2
| PDF (41 KB)
• ### Fast Solution of$\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse

Publication Year: 2008, Page(s):4789 - 4812
Cited by:  Papers (329)  |  Patents (1)
| | PDF (1899 KB) | HTML

The minimum lscr1-norm solution to an underdetermined system of linear equationsy=Axis often, remarkably, also the sparsest solution to that system. This sparsity-seeking property is of interest in signal processing and information transmission. However, general-purpose optimizers are much too slow for lscr1minimization in many large-scale applications.In this p... View full abstract»

• ### On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations

Publication Year: 2008, Page(s):4813 - 4820
Cited by:  Papers (132)  |  Patents (4)
| | PDF (377 KB) | HTML

An underdetermined linear system of equations <i>Ax</i> = <i>b</i> with nonnegativity constraint <i>x</i> ges 0 is considered. It is shown that for matrices <i>A</i> with a row-span intersecting the positive orthant, if this problem admits a sufficiently sparse solution, it is necessarily unique. The bound on the required sparsity depends on a cohere... View full abstract»

• ### Optimal Successive Group Decoders for MIMO Multiple-Access Channels

Publication Year: 2008, Page(s):4821 - 4846
Cited by:  Papers (17)  |  Patents (3)
| | PDF (930 KB) | HTML

We consider a slow-fading narrowband multiple-input multiple-output (MIMO) multiple-access channel (MAC) in which multiple users, each equipped with multiple transmit antennas, communicate to a receiver equipped with multiple receive antennas. The users are unaware of the channel state information (CSI) whereas the receiver has perfect CSI and employs a successive group decoder (SGD). We obtain ac... View full abstract»

• ### Design of Spherical Lattice Space–Time Codes

Publication Year: 2008, Page(s):4847 - 4865
Cited by:  Papers (2)
| | PDF (631 KB) | HTML

In this paper, we propose a systematic procedure for designing spherical lattice (space-time) codes. By employing stochastic optimization techniques we design lattice codes which are well matched to the fading statistics as well as to the decoder used at the receiver. The decoders we consider here include the optimal albeit of highest decoding complexity maximum-likelihood (ML) decoder, the subopt... View full abstract»

• ### Embedded Rank Distance Codes for ISI Channels

Publication Year: 2008, Page(s):4866 - 4886
Cited by:  Papers (3)
| | PDF (793 KB) | HTML

Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multilevel space-time codes for flat-fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto quadrature amplitude modulation (QAM) and phase-shift keying (PSK) co... View full abstract»

• ### Outage Capacity of MIMO Poisson Fading Channels

Publication Year: 2008, Page(s):4887 - 4907
Cited by:  Papers (27)
| | PDF (1356 KB) | HTML

The information outage probability of a shot-noise limited direct detection multiple-input-multiple-output (MIMO) optical channel subject to block fading is considered. Information is transmitted over this channel by modulating the intensity of a number of optical signals, one corresponding to each transmit aperture, and individual photon arrivals are observed at multiple receive photodetector ape... View full abstract»

• ### Cooperative Fading Regions for Decode and Forward Relaying

Publication Year: 2008, Page(s):4908 - 4924
Cited by:  Papers (16)
| | PDF (973 KB) | HTML

Cooperative transmission protocols over fading channels are based on a number of relaying nodes to form virtual multi-antenna transmissions. Diversity provided by these techniques has been widely analyzed for the Rayleigh fading case. However, short range or fixed wireless communications often experience propagation environments where the fading envelope distribution is meaningfully different from... View full abstract»

• ### Detection of Information Flows

Publication Year: 2008, Page(s):4925 - 4945
Cited by:  Papers (23)
| | PDF (1221 KB) | HTML

The detection of information flows by timing analysis is considered. Given transmission timestamps of monitored nodes, the problem is to decide whether there is an information flow through these nodes by analyzing the transmission patterns. Due to constraints that packets from an information flow need to be delivered within certain delay or the relay nodes have bounded memory, transmission pattern... View full abstract»

• ### Constrained Sequential Resource Allocation and Guessing Games

Publication Year: 2008, Page(s):4946 - 4965
| | PDF (646 KB) | HTML

In this paper, we consider a constrained sequential resource allocation problem where an individual needs to accomplish a task by repeatedly guessing/investing a sufficient level of effort/input. If the investment falls short of a minimum required level that is unknown to the individual, she fails; with each unsuccessful attempt, the individual then increases the input and tries again until she su... View full abstract»

• ### A Change-of-Measure Approach to Per- Flow Delay Measurement Combining Passive and Active Methods: Mathematical Formulation for CoMPACT Monitor

Publication Year: 2008, Page(s):4966 - 4979
Cited by:  Papers (5)
| | PDF (697 KB) | HTML

One problem with active measurement is that, while it is suitable for measuring time-average network performance, it is difficult to measure per-flow quality of service (QoS), which is defined as the average over packets in the flow. To achieve such per-flow QoS measurement, the authors proposed a new technique, called the change- of- measure-based passive/active monitoring (CoMPACT Monitor), whic... View full abstract»

• ### The Structure of General Interference Functions and Applications

Publication Year: 2008, Page(s):4980 - 4990
Cited by:  Papers (20)
| | PDF (309 KB) | HTML

This paper provides a theoretical framework for the analysis of interference-coupled multiuser systems. The fundamental behavior of such a system is modeled by interference functions, defined by axioms ldquononnegativity, rdquoscale-invariance,rdquo and ldquomonotonicity.rdquo It is shown that every interference function has an interpretation as the optimum of a min-max problem, where the optimiza... View full abstract»

• ### Average Stopping Set Weight Distributions of Redundant Random Ensembles

Publication Year: 2008, Page(s):4991 - 5004
Cited by:  Papers (6)
| | PDF (451 KB) | HTML

In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binary matrices with linearly dependent rows. These linearly dependent rows significantly reduce the number of stopping sets (SS) of small size. Upper and lower bounds on the average SS weight distribution of the redundant ran... View full abstract»

• ### Algebraic Decoding of the$(89, 45, 17)$Quadratic Residue Code

Publication Year: 2008, Page(s):5005 - 5011
Cited by:  Papers (31)
| | PDF (315 KB) | HTML

Recently, an algebraic decoding algorithm suggested by Truong (2005) for some quadratic residue codes with irreducible generating polynomials has been designed that uses the inverse-free Berlekamp-Massey (BM) algorithm to determine the error-locator polynomial. In this paper, based on the ideas of the algorithm mentioned above, an algebraic decoder for the (89, 45, 17) binary quadratic residue cod... View full abstract»

• ### Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes

Publication Year: 2008, Page(s):5012 - 5018
Cited by:  Papers (4)
| | PDF (199 KB) | HTML

We investigate the decoding region for algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error correction radius within which the soft-decision decoder produces a list that contains the transmitted codeword. The error radius for ASD is shown to be larger than that of Guruswami-Sudan (GS) hard-decisi... View full abstract»

• ### Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts Codes

Publication Year: 2008, Page(s):5019 - 5029
Cited by:  Papers (2)
| | PDF (340 KB) | HTML

Computation of the undetected error probability for error detecting codes over the Z-channel is an important issue, explored only in part in previous literature. In this paper, Varshamov-Tenengol'ts (VT) codes are considered. First, an exact formula for the probability of undetected errors is given. It can be explicitly computed for small code lengths (up to approximately 25). Next, some lower bou... View full abstract»

• ### The Information Lost in Erasures

Publication Year: 2008, Page(s):5030 - 5058
Cited by:  Papers (38)
| | PDF (744 KB) | HTML

We consider sources and channels with memory observed through erasure channels. In particular, we examine the impact of sporadic erasures on the fundamental limits of lossless data compression, lossy data compression, channel coding, and denoising. We define the erasure entropy of a collection of random variables as the sum of entropies of the individual variables conditioned on all the rest. The ... View full abstract»

• ### The Wiretap Channel With Feedback: Encryption Over the Channel

Publication Year: 2008, Page(s):5059 - 5067
Cited by:  Papers (94)
| | PDF (211 KB) | HTML

In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and feedback signals share the same noisy channel in the present model. Quite interestingly, this noisy feedback model is shown to be more advantageous in the current sett... View full abstract»

• ### On Unique Decodability

Publication Year: 2008, Page(s):5068 - 5072
| | PDF (148 KB) | HTML

In this paper, we propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete source <i>X</i>, every ldquouniquely decodablerdquo block code satisfies <i>E</i>[<i>l</i>(<i>X</i> <sub>1</sub>, <i>X</i> <sub>2</sub>,..., ... View full abstract»

• ### On the Construction of (Explicit) Khodak's Code and Its Analysis

Publication Year: 2008, Page(s):5073 - 5086
Cited by:  Papers (4)
| | PDF (437 KB) | HTML

Variable-to-variable (VV) codes are very attractive yet not well understood data compression schemes. In 1972, Khodak claimed to provide upper and lower bounds for the achievable redundancy rate, however, he did not offer explicit construction of such codes. In this paper, we first present a constructive and transparent proof of Khodak's result showing that for memoryless sources there exists a co... View full abstract»

• ### Performance of Sigma–Delta Quantizations in Finite Frames

Publication Year: 2008, Page(s):5087 - 5101
Cited by:  Papers (8)
| | PDF (1041 KB) | HTML

In this paper, we consider sigma-delta (SD) quantization of geometrically uniform (GU) finite frames. In the first part, we prove that under some conditions, the variant I and II permutation modulation (PM) codes, first introduced by Slepian (1968, 1965), can belong to the class of GU frames. Then, we focus essentially on a subclass of a GU frame, namely, cyclic geometrically uniform (CGU) frame, ... View full abstract»

• ### Optimality of CUSUM Rule Approximations in Change-Point Detection Problems: Application to Nonlinear State–Space Systems

Publication Year: 2008, Page(s):5102 - 5112
Cited by:  Papers (11)
| | PDF (296 KB) | HTML

The well-known cumulative sum (CUSUM) sequential rule for abrupt model change detection in stochastic dynamic systems relies on the knowledge of the probability density functions of the system output variables conditional on their past values and on the system functioning mode at each time step. This paper shows how to build an asymptotically optimal detection rule under the common average run len... View full abstract»

• ### Improved Estimation of Eigenvalues and Eigenvectors of Covariance Matrices Using Their Sample Estimates

Publication Year: 2008, Page(s):5113 - 5129
Cited by:  Papers (102)
| | PDF (858 KB) | HTML

The problem of estimating the eigenvalues and eigenvectors of the covariance matrix associated with a multivariate stochastic process is considered. The focus is on finite sample size situations, whereby the number of observations is limited and comparable in magnitude to the observation dimension. Using tools from random matrix theory, and assuming a certain eigenvalue splitting condition, new es... View full abstract»

• ### Functional Bregman Divergence and Bayesian Estimation of Distributions

Publication Year: 2008, Page(s):5130 - 5139
Cited by:  Papers (24)
| | PDF (266 KB) | HTML

A class of distortions termed functional Bregman divergences is defined, which includes squared error and relative entropy. A functional Bregman divergence acts on functions or distributions, and generalizes the standard Bregman divergence for vectors and a previous pointwise Bregman divergence that was defined for functions. A recent result showed that the mean minimizes the expected Bregman dive... 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