# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 34

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

Publication Year: 2007, Page(s): C2
| PDF (38 KB)
• ### Scanning and Sequential Decision Making for Multidimensional Data–Part I: The Noiseless Case

Publication Year: 2007, Page(s):3001 - 3020
Cited by:  Papers (9)  |  Patents (1)
| | PDF (479 KB) | HTML

We investigate the problem of scanning and prediction (ldquoscandiction,rdquo for short) of multidimensional data arrays. This problem arises in several aspects of image and video processing, such as predictive coding, for example, where an image is compressed by coding the error sequence resulting from scandicting it. Thus, it is natural to ask what is the optimal method to scan and predict a giv... View full abstract»

• ### A Unified SNR-Dependent Analysis of Space–Time Codes in Fading Channels

Publication Year: 2007, Page(s):3021 - 3034
Cited by:  Papers (2)
| | PDF (411 KB) | HTML

The pairwise error probability (PEP) for multiple- input multiple-output (MIMO) radio interfaces is investigated by means of a novel formulation based on compound matrices. The proposed approach is suitable for any MIMO system having average upper-bounded PEP written as [det( I + gammaA)]-zeta, whereAis a Hermitian matrix, zeta an integer number, and gamma the signal-to-no... View full abstract»

• ### Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications

Publication Year: 2007, Page(s):3035 - 3041
Cited by:  Papers (54)
| | PDF (215 KB) | HTML

In this paper we present a unified way to determine the values and their multiplicities of the exponential sums Sigma<sub>xisinF(q)</sub>zeta<sub>p</sub> <sup>Tr(af(x)+bx)</sup>(a,bisinF<sub>q</sub>,q=p<sup>m</sup>,pges3) for all perfect nonlinear functions f which is a Dembowski-Ostrom polynomial or p = 3,f=<sup>x(3(k)+1)/2</sup... View full abstract»

• ### Perfect Codes for Metrics Induced by Circulant Graphs

Publication Year: 2007, Page(s):3042 - 3052
Cited by:  Papers (27)
| | PDF (535 KB) | HTML

An algebraic methodology for defining new metrics over two-dimensional signal spaces is presented in this work. We have mainly considered quadrature amplitude modulation (QAM) constellations which have previously been modeled by quotient rings of Gaussian integers. The metric over these constellations, based on the distance concept in circulant graphs, is one of the main contributions of this work... View full abstract»

• ### Cyclic Algebras for Noncoherent Differential Space–Time Coding

Publication Year: 2007, Page(s):3053 - 3065
Cited by:  Papers (15)
| | PDF (727 KB) | HTML

We investigate cyclic algebras for coding over the differential noncoherent channel. Cyclic algebras are an algebraic object that became popular for coherent space-time coding, since it naturally yields linear families of matrices with full diversity. Coding for the differential noncoherent channel has a similar flavor in the sense that it asks for matrices that achieve full diversity, except that... View full abstract»

• ### A Study on Universal Codes With Finite Block Lengths

Publication Year: 2007, Page(s):3066 - 3074
Cited by:  Papers (9)
| | PDF (690 KB) | HTML

Based on random codes and typical set decoding, an alternative proof of Root and Varaiya's compound channel coding theorem for linear Gaussian channels is presented. The performance limit of codes with finite block length under a compound channel is studied through error bounds and simulation. Although the theorem promises uniform convergence of the probability of error as the block length approac... View full abstract»

• ### Rank-$2$-Optimal Adaptive Design of Binary Spreading Codes

Publication Year: 2007, Page(s):3075 - 3080
Cited by:  Papers (39)
| | PDF (255 KB) | HTML

Over the real/complex field, the spreading code that maximizes the signal-to-interference-plus-noise ratio (SINR) at the output of the maximum-SINR linear filter is the minimum-eigenvalue eigenvector of the interference autocovariance matrix. In the context of binary spreading codes, the maximization problem is NP-hard with complexity exponential in the code length. A new method for the optimizati... View full abstract»

• ### On Joint Source and Channel Coding Using Trellis Coded CPM: Analytical Bounds on the Channel Distortion

Publication Year: 2007, Page(s):3081 - 3094
Cited by:  Papers (2)
| | PDF (519 KB) | HTML

Joint source and channel coding (JSCC) using trellis coded quantization (TCQ) in conjunction with trellis coded continuous phase modulation (CPM) is studied. The channel is assumed to be the additive white gaussian noise (AWGN) channel. Analytical bounds on the channel distortion for the investigated systems with maximum-likelihood sequence detection (MLSD) are developed. The bounds are based on t... View full abstract»

Publication Year: 2007, Page(s):3095 - 3113
Cited by:  Papers (96)
| | PDF (482 KB) | HTML

We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multiuser wireless downlink with randomly varying channels. First, we extend the Berry-Gallager bound to a multiuser context, demonstrating that any algorithm that yields average power within <i>O</i>(1/<i>V</i>) of the minimum power required for network stability must also have an average qu... View full abstract»

• ### Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme

Publication Year: 2007, Page(s):3114 - 3126
Cited by:  Papers (177)  |  Patents (1)
| | PDF (638 KB) | HTML

In a slow-fading channel, how to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decode-and-forward (DF) schemes do not improve with the number of relays in terms of the diversity-multiplexing tradeoff (DMT) for multiplexing gains <i>r</i> higher than 0.5. In this work... View full abstract»

• ### A Linear Distinguishing Attack on Scream

Publication Year: 2007, Page(s):3127 - 3144
Cited by:  Papers (2)
| | PDF (646 KB) | HTML

A linear distinguishing attack on the stream cipher Scream is proposed. When the keystream is of length 2<sup>98</sup> words, the distinguisher has a detectable advantage. When the keystream length is around 2<sup>120</sup> the advantage is very close to 1. This shows certain weaknesses of Scream. In the process, the paper introduces new general ideas on how to improve the ... View full abstract»

• ### Blind Minimax Estimation

Publication Year: 2007, Page(s):3145 - 3157
Cited by:  Papers (28)
| | PDF (449 KB) | HTML

We consider the linear regression problem of estimating an unknown, deterministic parameter vector based on measurements corrupted by colored Gaussian noise. We present and analyze blind minimax estimators (BMEs), which consist of a bounded parameter set minimax estimator, whose parameter set is itself estimated from measurements. Thus, our approach does not require any prior assumption or knowled... View full abstract»

• ### Multiuser Detection in a Dynamic Environment– Part I: User Identification and Data Detection

Publication Year: 2007, Page(s):3158 - 3170
Cited by:  Papers (42)  |  Patents (1)
| | PDF (1269 KB) | HTML

In random-access communication systems, the number of active users varies with time, and has considerable bearing on receiver's performance. Thus, techniques aimed at identifying not only the information transmitted, but also that number, play a central role in those systems. An example of application of these techniques can be found in multiuser detection (MUD). In typical MUD analyses, receivers... View full abstract»

• ### Multiscale Poisson Intensity and Density Estimation

Publication Year: 2007, Page(s):3171 - 3187
Cited by:  Papers (46)
| | PDF (1292 KB) | HTML

The nonparametric Poisson intensity and density estimation methods studied in this paper offer near minimax convergence rates for broad classes of densities and intensities with arbitrary levels of smoothness. The methods and theory presented here share many of the desirable features associated with wavelet-based estimators: computational speed, spatial adaptivity, and the capability of detecting ... View full abstract»

• ### On Polar Polytopes and the Recovery of Sparse Representations

Publication Year: 2007, Page(s):3188 - 3195
Cited by:  Papers (17)
| | PDF (340 KB) | HTML

Suppose we have a signal y which we wish to represent using a linear combination of a number of basis atoms a<sub>i</sub>,y=Sigma<sub>i</sub>x<sub>i</sub>a<sub>i</sub>=Ax. The problem of finding the minimum l<sub>0</sub> norm representation for y is a hard problem. The basis pursuit (BP) approach proposes to find the minimum l<sub>1... View full abstract»

• ### Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes

Publication Year: 2007, Page(s):3196 - 3201
Cited by:  Papers (8)
| | PDF (239 KB) | HTML

Stopping sets, and in particular their numbers and sizes, play an important role in determining the performance of iterative decoders of linear codes over binary erasure channels. In the 2004 Shannon Lecture, McEliece presented an expression for the number of stopping sets of size three for a full-rank parity-check matrix of the Hamming code. In this correspondence, we derive an expression for the... View full abstract»

• ### On the BCJR Algorithm for Rate-Distortion Source Coding

Publication Year: 2007, Page(s):3201 - 3207
| | PDF (280 KB) | HTML

The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is an important channel decoding method. We extend it to trellis rate-distortion data compression. Beginning from source coding principles, the derivation of the algorithm avoids channel coding or soft output ideas. The encoder does not use entropy coding; equiprobable reproducer letters are emphasized since these maximize entropy. The BCJR method is d... View full abstract»

• ### A Note on LÉvÊque and Telatar's Upper Bound on the Capacity of WirelessAd HocNetworks

Publication Year: 2007, Page(s):3207 - 3211
Cited by:  Papers (8)
| | PDF (209 KB) | HTML

An alternative proof of the Leveque-Telatar (2005) upper bound on the maximum achievable information rate per communication pair in a wireless ad hoc network is presented. The argument exploits the spatial structure of the random point process representing the location of the nodes, and it is based on a simple geometric ldquostrippingrdquo construction that avoids complicated large deviation estim... View full abstract»

• ### Stability Region of Multicarrier Channel Aware Aloha

Publication Year: 2007, Page(s):3212 - 3218
Cited by:  Papers (2)
| | PDF (436 KB) | HTML

In this correspondence, we have studied the stability properties of multicarrier channel aware Aloha. For a simple two-user network, the stability regionS2under the classical collision model has been well-studied. In this correspondence, using multiple carriers, we show how to achieve any input rate vector inS2with 1-persistent Aloha. We then show how multicarri... View full abstract»

• ### Fading-Resilient Super-Orthogonal Space-Time Signal Sets: Can Good Constellations Survive in Fading?

Publication Year: 2007, Page(s):3219 - 3225
Cited by:  Papers (2)
| | PDF (299 KB) | HTML

In this correspondence, first-tier indirect (direct) discernible constellation expansions are defined for generalized orthogonal designs. The expanded signal constellation, leading to so-called super-orthogonal codes, allows the achievement of coding gains in addition to diversity gains enabled by orthogonal designs. Conditions that allow the shape of an expanded multidimensional constellation to ... View full abstract»

• ### Source Coding Using Families of Universal Hash Functions

Publication Year: 2007, Page(s):3226 - 3233
Cited by:  Papers (7)
| | PDF (341 KB) | HTML

This correspondence is concerned with new connections between source coding and two kinds of families of hash functions known as the families of universal hash functions and N-strongly universal hash functions, where N ges 2 is an integer. First, it is pointed out that such families contain classes of well-known source codes such as bin codes and linear codes. Next, performance of a source coding ... View full abstract»

• ### On Defining Partition Entropy by Inequalities

Publication Year: 2007, Page(s):3233 - 3239
Cited by:  Papers (6)
| | PDF (259 KB) | HTML

Partition entropy is the numerical metric of uncertainty within a partition of a finite set, while conditional entropy measures the degree of difficulty in predicting a decision partition when a condition partition is provided. Since two direct methods exist for defining conditional entropy based on its partition entropy, the inequality postulates of monotonicity, which conditional entropy satisfi... View full abstract»

• ### Application of Tauberian Theorem to the Exponential Decay of the Tail Probability of a Random Variable

Publication Year: 2007, Page(s):3239 - 3249
Cited by:  Papers (11)
| | PDF (418 KB) | HTML

In this correspondence, we give a sufficient condition for the exponential decay of the tail probability of a nonnegative random variable. We consider the Laplace-Stieltjes transform of the probability distribution function of the random variable. We present a theorem, according to which if the abscissa of convergence of the LS transform is negative finite and the real point on the axis of converg... 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