# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 55

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

Publication Year: 2008, Page(s): C2
| PDF (41 KB)
• ### Highly Robust Error Correction byConvex Programming

Publication Year: 2008, Page(s):2829 - 2840
Cited by:  Papers (68)  |  Patents (1)
| | PDF (489 KB) | HTML

This paper discusses a stylized communications problem where one wishes to transmit a real-valued signal (a block of pieces of information) to a remote receiver. We ask whether it is possible to transmit this information reliably when a fraction of the transmitted codeword is corrupted by arbitrary gross errors, and when in addition, all the entries of the codeword are contaminated by smaller erro... View full abstract»

• ### A Graph-Based Framework for Transmission of Correlated Sources Over Broadcast Channels

Publication Year: 2008, Page(s):2841 - 2856
Cited by:  Papers (17)
| | PDF (478 KB) | HTML

In this paper, we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for this information transmission problem. The system involves a source coding module and a channel coding module. In the source coding module, the sources are efficiently mapped into a nearly semi-regular bipartite graph, and in the cha... View full abstract»

• ### Worst Case Nonzero-Error Interactive Communication

Publication Year: 2008, Page(s):2857 - 2867
| | PDF (271 KB) | HTML

In the interactive communication model, two parties and possess respective private but correlated inputs and , and wants to learn from while minimizing the communication required for the worst possible input pair . Our contribution is the analysis of four nonzero-error models in this correlated data setting. In the private coin randomized model, both players are allowed to toss coins, and must lea... View full abstract»

• ### Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels

Publication Year: 2008, Page(s):2868 - 2878
Cited by:  Papers (128)  |  Patents (1)
| | PDF (371 KB) | HTML

This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. To derive decentralized solutions that do not require any cooperation among the users, the optimization problem is formulated as a static noncooperative game of complete information. To achieve the so-called Nash equilibr... View full abstract»

• ### Asymptotic Capacity of Multicarrier Transmission With Frequency-Selective Fading and Limited Feedback

Publication Year: 2008, Page(s):2879 - 2902
Cited by:  Papers (18)
| | PDF (1214 KB) | HTML

We study the capacity of multicarrier transmission through a slow frequency-selective fading channel with limited feedback, which specifies channel state information. Our results are asymptotic in the number of subchannels . We first assume independent and identically distributed (i.i.d.) subchannel gains, and show that, for a large class of fading distributions, a uniform power distribution over ... View full abstract»

• ### Successive Refinement Via Broadcast: Optimizing Expected Distortion of a Gaussian Source Over a Gaussian Fading Channel

Publication Year: 2008, Page(s):2903 - 2918
Cited by:  Papers (49)
| | PDF (937 KB) | HTML

We consider the problem of transmitting a Gaussian source on a slowly fading Gaussian channel, subject to the mean-squared error distortion measure. The channel state information is known only at the receiver but not at the transmitter. The source is assumed to be encoded in a successive refinement (SR) manner, and then transmitted over the channel using the broadcast strategy. In order to minimiz... View full abstract»

• ### Error Exponent Regions for Gaussian Broadcast and Multiple-Access Channels

Publication Year: 2008, Page(s):2919 - 2942
Cited by:  Papers (26)
| | PDF (723 KB) | HTML

In modern communication systems, different users have different requirements for quality of service (QoS). In this work, QoS refers to the average codeword error probability experienced by the users in the network. Although several practical schemes (collectively referred to as unequal error protection schemes) have been studied in the literature and are implemented in existing systems, the corres... View full abstract»

• ### On the Distortion SNR Exponent of Some Layered Transmission Schemes

Publication Year: 2008, Page(s):2943 - 2958
Cited by:  Papers (27)
| | PDF (1088 KB) | HTML

We consider the problem of joint source-channel coding for transmitting K samples of a complex Gaussian source overT bK uses of a block-fading multiple-input multiple-output (MIMO) channel with M transmit and N receive antennas. We consider the case when we are allowed to code over L blocks. The channel gain is assumed to be constant over a block and channel gains for different blocks are assumed ... View full abstract»

• ### Diversity and Multiplexing Tradeoff of Spatial Multiplexing MIMO Systems With CSI

Publication Year: 2008, Page(s):2959 - 2975
Cited by:  Papers (8)
| | PDF (439 KB) | HTML

Following the seminal work of Zheng and Tse, this paper investigates the fundamental diversity and multiplexing tradeoff of multiple-input-multiple-output (MIMO) systems in which knowledge of the channel state at both sides of the link is employed to transmit independent data streams through the channel eigenmodes. First, the fundamental diversity and multiplexing tradeoff of each of the individua... View full abstract»

• ### MIMO Diversity in the Presence of Double Scattering

Publication Year: 2008, Page(s):2976 - 2996
Cited by:  Papers (99)
| | PDF (828 KB) | HTML

The potential benefits of multiple-antenna systems may be limited by two types of channel degradations-rank deficiency and spatial fading correlation of the channel. In this paper, we assess the effects of these degradations on the diversity performance of multiple-input multiple-output (MIMO) systems, with an emphasis on orthogonal space-time block codes (OSTBC), in terms of the symbol error prob... View full abstract»

• ### Fast Distributed Algorithms for Computing Separable Functions

Publication Year: 2008, Page(s):2997 - 3007
Cited by:  Papers (72)
| | PDF (287 KB) | HTML

The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer, and ad hoc networks. The task of computing separable functions, which can be written as linear combinations of functions of individual variables, is studied in th... View full abstract»

• ### Communication Via Decentralized Processing

Publication Year: 2008, Page(s):3008 - 3023
Cited by:  Papers (81)  |  Patents (1)
| | PDF (517 KB) | HTML

The problem of a nomadic terminal sending information to a remote destination via agents with lossless connections to the destination is investigated. Such a setting suits, e.g., access points of a wireless network where each access point is connected by a wire to a wireline-based network. The Gaussian codebook capacity for the case where the agents do not have any decoding ability is characterize... View full abstract»

• ### Laminated turbo codes: A new class of block-convolutional codes

Publication Year: 2008, Page(s):3024 - 3034
Cited by:  Papers (4)
| | PDF (455 KB) | HTML

In this paper, a new class of codes is presented that features a block-convolutional structure-namely, laminated turbo codes. It allows combining the advantages of both a convolutional encoder memory and a block permutor, thus allowing a block-oriented decoding method. Structural properties of laminated turbo codes are analyzed and upper and lower bounds on free distance are obtained. It is then s... View full abstract»

• ### A Decomposition Theory for Binary Linear Codes

Publication Year: 2008, Page(s):3035 - 3058
Cited by:  Papers (21)
| | PDF (604 KB) | HTML

The decomposition theory of matroids initiated by Paul Seymour in the 1980s has had an enormous impact on research in matroid theory. This theory, when applied to matrices over the binary field, yields a powerful decomposition theory for binary linear codes. In this paper, we give an overview of this code decomposition theory, and discuss some of its implications in the context of the recently dis... View full abstract»

• ### Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-AlphabetMemoryless Sources

Publication Year: 2008, Page(s):3059 - 3077
Cited by:  Papers (3)
| | PDF (467 KB) | HTML

The problem of joint universal source coding and density estimation is considered in the setting of fixed-rate lossy coding of continuous-alphabet memoryless sources. For a wide class of bounded distortion measures, it is shown that any compactly parametrized family of Rd -valued independent and identically distributed (i.i.d.) sources with absolutely continuous distributions satisfying... View full abstract»

• ### Entanglement-Assisted Capacity of Quantum Multiple-Access Channels

Publication Year: 2008, Page(s):3078 - 3090
Cited by:  Papers (28)
| | PDF (346 KB) | HTML

We find a regularized formula for the entanglement-assisted (EA) capacity region for quantum multiple-access channels (QMAC). We illustrate the capacity region calculation with the example of the collective phase-flip channel which admits a single-letter characterization. On the way, we provide a first-principles proof of the EA coding theorem based on a packing argument. We observe that the Holev... View full abstract»

• ### Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions

Publication Year: 2008, Page(s):3091 - 3113
Cited by:  Papers (34)
| | PDF (503 KB) | HTML

In this paper, we consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multiletter characterizations of two different two-dimensional capacity regions. The first region comprises the rates at which it is possible for one sender to send classical information, while the other sends quantum information. The second region consists of the rates at which ea... View full abstract»

• ### A Framework for the Construction ofGolay Sequences

Publication Year: 2008, Page(s):3114 - 3129
Cited by:  Papers (30)
| | PDF (574 KB) | HTML

In 1999, Davis and Jedwab gave an explicit algebraic normal form for m!/2 - 2h(m+1) ordered Golay pairs of length 2mmiddot over Z2h, involving m!/2 - 2h(m+1) Golay sequences. In 2005, Li and Chu unexpectedly found an additional 1024 length 16 quaternary Golay sequences. Fiedler and Jedwab showed in 2006 that these new Golay sequences exist because of a "... View full abstract»

• ### The Correlation Distribution of Quaternary Sequences of Period $2(2^n-1)$

Publication Year: 2008, Page(s):3130 - 3139
Cited by:  Papers (9)
| | PDF (285 KB) | HTML

Family A is a family of sequences of period 2n - 1 over Zi, the ring of integers modulo 4. This family has optimal correlation properties and its correlation distribution is well known. Two related families of quaternary sequences are the families B and C. These are families of sequences over Z4 of period 2(2n - 1). In recent years, new families of quaternary seque... View full abstract»

• ### Cross-Correlation Distribution of $p$ -ary $m$-Sequence of Period $p^{4k}-1$ and Its Decimated Sequences by $left({{ p^{2k}+1}over { 2}}right)^{2}$

Publication Year: 2008, Page(s):3140 - 3149
Cited by:  Papers (23)
| | PDF (294 KB) | HTML

For an odd prime p, n=4k, and d=((p2k+1)/2)2, there are (p2k+1)/2 distinct decimated sequences s(dt+l), 0lesl<(p2k+)/2,of a p-ary m-sequence s(t) of period pn-1 because gcd(d,pn-1)=(p2k+1)/2. In this paper, it is shown that the cross-correlation function between s(t) and s(dt+l),0lesl<(p2k+1)/2, takes the... View full abstract»

• ### Capacity of the Trapdoor Channel With Feedback

Publication Year: 2008, Page(s):3150 - 3165
Cited by:  Papers (60)
| | PDF (462 KB) | HTML

We establish that the feedback capacity of the trapdoor channel is the logarithm of the golden ratio and provide a simple communication scheme that achieves capacity. As part of the analysis, we formulate a class of dynamic programs that characterize capacities of unifilar finite-state channels. The trapdoor channel is an instance that admits a simple closed-form solution. View full abstract»

• ### On the Minimum Entropy of a Mixture of Unimodal and Symmetric Distributions

Publication Year: 2008, Page(s):3166 - 3174
Cited by:  Papers (6)
| | PDF (518 KB) | HTML

Progressive encoding of a signal generally involves an estimation step, designed to reduce the entropy of the residual of an observation over the entropy of the observation itself. Oftentimes the conditional distributions of an observation, given already-encoded observations, are well fit within a class of symmetric and unimodal distributions (e.g., the two-sided geometric distributions in images ... View full abstract»

• ### Distributed Estimation Via Random Access

Publication Year: 2008, Page(s):3175 - 3181
Cited by:  Papers (4)
| | PDF (574 KB) | HTML

In this correspondence, the problem of distributed Bayesian estimation is considered in the context of a wireless sensor network. The Bayesian estimation performance is analyzed in terms of the expected Fisher information normalized by the transmission rate of the sensors. The sensors use a communication scheme known as the type-based random access (TBRA) scheme. Under a constraint on the expected... 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