# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 49

Publication Year: 2006, Page(s):c1 - c4
| |PDF (46 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2006, Page(s): c2
| |PDF (38 KB)
• ### Explicit Space&#8211;Time Codes Achieving the Diversity&#8211;Multiplexing Gain Tradeoff

Publication Year: 2006, Page(s):3869 - 3884
Cited by:  Papers (182)  |  Patents (1)
| |PDF (504 KB) | HTML

A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be simultaneously achieved by a space-time (ST) code. This tradeoff is precisely known in the case of independent and identically distributed (i.i.d.) Rayl... View full abstract»

• ### Perfect Space&#8211;Time Block Codes

Publication Year: 2006, Page(s):3885 - 3902
Cited by:  Papers (292)  |  Patents (6)
| |PDF (524 KB) | HTML

In this paper, we introduce the notion of perfect space-time block codes (STBCs). These codes have full-rate, full-diversity, nonvanishing constant minimum determinant for increasing spectral efficiency, uniform average transmitted energy per antenna and good shaping. We present algebraic constructions of perfect STBCs for 2, 3, 4, and 6 antennas View full abstract»

• ### Unitary Nongroup STBC From Cyclic Algebras

Publication Year: 2006, Page(s):3903 - 3912
Cited by:  Papers (4)
| |PDF (387 KB) | HTML

Space-time block codes (STBCs) are designed for multiple-input-multiple-output (MIMO) channels. In order to avoid errors, single-input-single-output (SISO) fading channels require long coding blocks and interleavers that result in high delays. If one wishes to increase the data rate it is necessary to take advantage of space diversity. Early STBC, that where developed by Alamouti for known channel... View full abstract»

• ### Information-Lossless Space&#8211;Time Block Codes From Crossed-Product Algebras

Publication Year: 2006, Page(s):3913 - 3935
Cited by:  Papers (25)
| |PDF (732 KB) | HTML

It is known that the Alamouti code is the only complex orthogonal design (COD) which achieves capacity and that too for the case of two transmit and one receive antenna only. Damen proposed a design for two transmit antennas, which achieves capacity for any number of receive antennas, calling the resulting space-time block code (STBC) when used with a signal set an information-lossless STBC. In th... View full abstract»

• ### The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel

Publication Year: 2006, Page(s):3936 - 3964
Cited by:  Papers (945)  |  Patents (12)
| |PDF (746 KB) | HTML

The Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC) is considered. The dirty-paper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequality, to show that a superposition of Gaussian codes is optimal for the degraded vector broadcast cha... View full abstract»

• ### Finite-SNR Diversity&#8211;Multiplexing Tradeoff for Correlated Rayleigh and Rician MIMO Channels

Publication Year: 2006, Page(s):3965 - 3979
Cited by:  Papers (134)
| |PDF (509 KB) | HTML

A nonasymptotic framework is presented to analyze the diversity-multiplexing tradeoff of a multiple-input-multiple-output (MIMO) wireless system at finite signal-to-noise ratios (SNRs). The target data rate at each SNR is proportional to the capacity of an additive white Gaussian noise (AWGN) channel with an array gain. The proportionality constant, which can be interpreted as a finite-SNR spatial... View full abstract»

• ### Multiple-Access Strategies for Frequency-Selective MIMO Channels

Publication Year: 2006, Page(s):3980 - 3993
Cited by:  Papers (6)
| |PDF (435 KB) | HTML

In this paper, we consider frequency-selective coherent multiple-input multiple-output (MIMO) multiple-access fading channels. Assuming that each of the users employs orthogonal frequency-division multiplexing (OFDM), we introduce a multiple-access scheme that gradually varies the amount of user collision in signal space by assigning different subsets of the available OFDM tones to different users... View full abstract»

• ### On the Entropy Rate of Pattern Processes

Publication Year: 2006, Page(s):3994 - 4007
Cited by:  Papers (10)
| |PDF (358 KB) | HTML

We study the entropy rate of pattern sequences of stochastic processes, and its relationship to the entropy rate of the original process. We give a complete characterization of this relationship for independent and identically distributed (i.i.d.) processes over arbitrary alphabets, stationary ergodic processes over discrete alphabets, and a broad family of stationary ergodic processes over uncoun... View full abstract»

• ### An Algorithm for Universal Lossless Compression With Side Information

Publication Year: 2006, Page(s):4008 - 4016
Cited by:  Papers (15)  |  Patents (3)
| |PDF (309 KB) | HTML

This paper proposes a new algorithm based on the Context-Tree Weighting (CTW) method for universal compression of a finite-alphabet sequence x1 n with side information y1 n available to both the encoder and decoder. We prove that with probability one the compression ratio converges to the conditional entropy rate for jointly stationary ergodic sources. E... View full abstract»

• ### On the Structure of Optimal Real-Time Encoders and Decoders in Noisy Communication

Publication Year: 2006, Page(s):4017 - 4035
Cited by:  Papers (58)
| |PDF (511 KB) | HTML

The output of a discrete-time Markov source must be encoded into a sequence of discrete variables. The encoded sequence is transmitted through a noisy channel to a receiver that must attempt to reproduce reliably the source sequence. Encoding and decoding must be done in real-time and the distortion measure does not tolerate delays. The structure of real-time encoding and decoding strategies that ... View full abstract»

• ### Signal Reconstruction From Noisy Random Projections

Publication Year: 2006, Page(s):4036 - 4048
Cited by:  Papers (296)  |  Patents (4)
| |PDF (344 KB) | HTML

Recent results show that a relatively small number of random projections of a signal can contain most of its salient information. It follows that if a signal is compressible in some orthonormal basis, then a very accurate reconstruction can be obtained from random projections. This "compressive sampling" approach is extended here to show that signals can be accurately recovered from random project... View full abstract»

• ### Optimality of KLT for High-Rate Transform Coding of Gaussian Vector-Scale Mixtures: Application to Reconstruction, Estimation, and Classification

Publication Year: 2006, Page(s):4049 - 4067
Cited by:  Papers (16)
| |PDF (532 KB) | HTML

The Karhunen-Loeacuteve transform (KLT) is known to be optimal for high-rate transform coding of Gaussian vectors for both fixed-rate and variable-rate encoding. The KLT is also known to be suboptimal for some non-Gaussian models. This paper proves high-rate optimality of the KLT for variable-rate encoding of a broad class of non-Gaussian vectors: Gaussian vector-scale mixtures (GVSM), which exten... View full abstract»

• ### Joint Permutor Analysis and Design for Multiple Turbo Codes

Publication Year: 2006, Page(s):4068 - 4083
Cited by:  Papers (16)
| |PDF (491 KB) | HTML

In this paper, we study the problem of joint permutor analysis and design for J-dimensional multiple turbo codes with J constituent encoders, J>2. The concept of summary distance is extended to multiple permutors of size N and used as the design metric. Using the sphere-packing concept, we prove that the minimum length-2 summary distance (spread) Dmin,2 is asymptoticly upper-bounded ... View full abstract»

• ### Achievable Rates and Scaling Laws of Power-Constrained Wireless Sensory Relay Networks

Publication Year: 2006, Page(s):4084 - 4104
Cited by:  Papers (35)
| |PDF (589 KB) | HTML

A wireless sensory relay network consists of one source node, one destination node and multiple intermediate relay nodes. In this paper, we study the achievable rates and the scaling laws of power-constrained wireless relay networks in the wideband regime, assuming that relay nodes have no a priori knowledge of channel-state information (CSI) for both the backward channels and the forward channels... View full abstract»

• ### A Min-Plus Calculus for End-to-End Statistical Service Guarantees

Publication Year: 2006, Page(s):4105 - 4114
Cited by:  Papers (63)
| |PDF (284 KB) | HTML

The network calculus offers an elegant framework for determining worst-case bounds on delay and backlog in a network. This paper extends the network calculus to a probabilistic framework with statistical service guarantees. The notion of a statistical service curve is presented as a probabilistic bound on the service received by an individual flow or an aggregate of flows. The problem of concatena... View full abstract»

• ### Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case

Publication Year: 2006, Page(s):4115 - 4141
Cited by:  Papers (69)  |  Patents (1)
| |PDF (908 KB) | HTML

Contemporary wireless systems combine aspects of network theory such as scheduling, throughput, and delay as well as information theory aspects such as capacity, coding, and power control. Design of such systems requires joint optimization of both network and physical layers. In this paper, we analyze a single-user communication system composed of a transmitter preceded by a queue used for retrans... View full abstract»

• ### Generalized Bent Criteria for Boolean Functions (I)

Publication Year: 2006, Page(s):4142 - 4159
Cited by:  Papers (27)  |  Patents (1)
| |PDF (555 KB) | HTML

Generalizations of the bent property of a Boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic Boolean functions are related to simple graphs and it is shown that the orbit generated by successive local complementations on a graph can be found within the transform spectra under investigation. The flat spectra of a q... View full abstract»

• ### On Almost Perfect Nonlinear Functions Over$mmb F_2^n$

Publication Year: 2006, Page(s):4160 - 4170
Cited by:  Papers (40)
| |PDF (293 KB) | HTML

We investigate some open problems on almost perfect nonlinear (APN) functions over a finite field of characteristic 2. We provide new characterizations of APN functions and of APN permutations by means of their component functions. We generalize some results of Nyberg (1994) and strengthen a conjecture on the upper bound of nonlinearity of APN functions. We also focus on the case of quadratic func... View full abstract»

• ### Equivalence of Decoupling Schemes and Orthogonal Arrays

Publication Year: 2006, Page(s):4171 - 4181
Cited by:  Papers (9)  |  Patents (1)
| |PDF (349 KB) | HTML

Decoupling schemes are used in quantum information processing to selectively switch off unwanted interactions in a multipartite Hamiltonian. A decoupling scheme consists of a sequence of local unitary operations which are applied to the system's qudits and alternate with the natural time evolution of the Hamiltonian. Several constructions of decoupling schemes have been given in the literature. He... View full abstract»

• ### Universal Compression of Markov and Related Sources Over Arbitrary Alphabets

Publication Year: 2006, Page(s):4182 - 4190
Cited by:  Papers (3)
| |PDF (388 KB) | HTML

Recent work has considered encoding a string by separately conveying its symbols and its pattern-the order in which the symbols appear. It was shown that the patterns of independent and identically distributed (i.i.d.) strings can be losslessly compressed with diminishing per-symbol redundancy. In this correspondence, the pattern redundancy of distributions with memory is considered. Close lower a... View full abstract»

• ### On Successive Refinement of the Binary Symmetric Markov Source

Publication Year: 2006, Page(s):4190 - 4197
| |PDF (360 KB) | HTML

We show that for every n>2 the standard nth-order approximation Rn(D), to the rate-distortion function of the binary-symmetric Markov source (BSMS) is not successively refineable under the Hamming distortion measure in an open interval of the form D n<D<1/2=Dmax View full abstract»

• ### An Interpretation of Identification Entropy

Publication Year: 2006, Page(s):4198 - 4207
Cited by:  Papers (6)
| |PDF (453 KB) | HTML

After Ahlswede introduced identification for source coding he discovered identification entropy and demonstrated that it plays a role analogously to classical entropy in Shannon's noiseless source coding. We give now even more insight into this functional interpreting its two factors View full abstract»

• ### Coding for the Feedback Gel'fand&#8211;Pinsker Channel and the Feedforward Wyner&#8211;Ziv Source

Publication Year: 2006, Page(s):4207 - 4211
Cited by:  Papers (15)
| |PDF (238 KB) | HTML

We consider both channel coding and source coding, with perfect past feedback/feedforward, in the presence of side information. It is first observed that feedback does not increase the capacity of the Gel'fand-Pinsker channel, nor does feedforward improve the achievable rate-distortion performance in the Wyner-Ziv problem. We then focus on the Gaussian case showing that, as in the absence of side ... 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