# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 35

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

Publication Year: 2008, Page(s): C2
| PDF (42 KB)
• ### On the Role of Estimate-and-Forward With Time Sharing in Cooperative Communication

Publication Year: 2008, Page(s):4409 - 4431
Cited by:  Papers (44)  |  Patents (2)
| | PDF (1194 KB) | HTML

In this paper, we focus on the general relay channel. We investigate the application of the estimate-and-forward (EAF) relaying scheme to different scenarios. Specifically, we study assignments of the auxiliary random variable that always satisfy the feasibility constraints. We then consider the Gaussian relay channel with coded modulation, where we show that a three-level quantization outperforms... View full abstract»

• ### Mutual Information for Stochastic Signals and Fractional Brownian Motion

Publication Year: 2008, Page(s):4432 - 4438
Cited by:  Papers (8)
| | PDF (220 KB) | HTML

The mutual information between a stochastic signal and this signal plus a fractional Brownian motion (described as an additive fractional Gaussian noise channel) is expressed as the error of an estimation problem that can be naturally associated with this model. If the stochastic signal with the additive fractional Brownian motion occurs multiplied by a scalar parameter, then the rate of change of... View full abstract»

• ### Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators

Publication Year: 2008, Page(s):4439 - 4447
Cited by:  Papers (23)
| | PDF (326 KB) | HTML

The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen's inequality as well as some other inequalities in the derivation, we demonstrate that an exponentially tight analysis can be carried out by assessing the relevant moments of certain distance enumerators. The resulting bound has the following advantages: (i) it is... View full abstract»

• ### Cooperative Multiple-Access Encoding With States Available at One Transmitter

Publication Year: 2008, Page(s):4448 - 4469
Cited by:  Papers (77)
| | PDF (1044 KB) | HTML

We generalize the Gel'fand-Pinsker model to encompass the setup of a memoryless multiple-access channel (MAC). According to this setup, only one of the encoders knows the state of the channel (noncausally), which is also unknown to the receiver. Two independent messages are transmitted: a common message and a message transmitted by the informed encoder. We find explicit characterizations of the ca... View full abstract»

• ### Dualities Between Entropy Functions and Network Codes

Publication Year: 2008, Page(s):4470 - 4487
Cited by:  Papers (42)
| | PDF (450 KB) | HTML

In communications networks, the capacity region of multisource network coding is given in terms of the set of entropy functions Gamma*. More broadly, determination of Gamma* would have an impact on converse theorems for multi-terminal problems in information theory. This paper provides several new dualities between entropy functions and network codes. Given a function g View full abstract»

• ### List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity

Publication Year: 2008, Page(s):4488 - 4492
Cited by:  Papers (4)
| | PDF (214 KB) | HTML

Let a biorthogonal Reed-Muller code RM (1,m) of length n = 2m be used on a memoryless channel with an input alphabet plusmn1 and a real-valued output R. Given any nonzero received vector y in the Euclidean space Rn and some parameter epsiisin(0,1), our goal is to perform list decoding of the code RM (1, m) and retrieve all codewords located within the angle arccos e from y. F... View full abstract»

• ### Maximal Orders in the Design of Dense Space-Time Lattice Codes

Publication Year: 2008, Page(s):4493 - 4510
Cited by:  Papers (24)
| | PDF (611 KB) | HTML

In this paper, we construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, nonvanishing determinants (NVDs) for four transmit antenna multiple-input-single-output (MISO) space-time (ST) applications. The constructions are based on the theory of rings of algebraic integers and related subrings of the Hamiltonian quaternions and can be extended to a larger number ... View full abstract»

• ### Full-Diversity Codes for MISO Systems Equipped With Linear or ML Detectors

Publication Year: 2008, Page(s):4511 - 4527
Cited by:  Papers (56)
| | PDF (1341 KB) | HTML

In this paper, a general criterion for space-time block codes (STBC) to achieve full diversity with a linear receiver is proposed for a wireless communication system having multiple transmitter and single receiver antennas [multiple-input-single-output (MISO)]. Particularly, the STBC with Toeplitz structure satisfies this criterion, and therefore, enables full diversity. Further examination of thi... View full abstract»

• ### Space–Time Block Codes Achieving Full Diversity With Linear Receivers

Publication Year: 2008, Page(s):4528 - 4547
Cited by:  Papers (81)
| | PDF (692 KB) | HTML

In most of the existing space-time code designs, achieving full diversity is based on maximum-likelihood (ML) decoding at the receiver that is usually computationally expensive and may not have soft outputs. Recently, Zhang-Liu-Wong introduced Toeplitz codes and showed that Toeplitz codes achieve full diversity when a linear receiver, zero-forcing (ZF) or minimum mean square error (MMSE) receiver,... View full abstract»

• ### Decode-and-Forward Relaying With Quantized Channel State Feedback: An Outage Exponent Analysis

Publication Year: 2008, Page(s):4548 - 4564
Cited by:  Papers (35)
| | PDF (628 KB) | HTML

The problem of resource allocation to maximize the outage exponent over a fading relay channel using the decode-and-forward protocol with quantized channel state feedback (CSF) is studied. Three different scenarios are considered: relay-to-source, destination-to-relay, and destination-to-source-and-relay CSF. In the relay-to-source CSF scenario, it is found that using merely one bit of CSF to cont... View full abstract»

• ### Rainbow Network Flow of Multiple Description Codes

Publication Year: 2008, Page(s):4565 - 4574
Cited by:  Papers (14)
| | PDF (344 KB) | HTML

This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of a multiple description (MD) source from multiple servers to multiple sinks. We aim at maximizing a collective metric of the quality of source reconstruction at all sinks, by optimally routing the MD source streams from t... View full abstract»

• ### On the Complexity of Hardness Amplification

Publication Year: 2008, Page(s):4575 - 4586
Cited by:  Papers (6)
| | PDF (375 KB) | HTML

For deltaisin(0,1) and k,n isinN, we study the task of transforming a hard function f: {0,1}nrarr {0,1}, with which any small circuit disagrees on (1-delta)/2 fraction of the input, into a harder function f', with which any small circuit disagrees on (1-deltak)/2 fraction of the input. First, we show that such hardness amplification, when carried out in so... View full abstract»

• ### A Resource Framework for Quantum Shannon Theory

Publication Year: 2008, Page(s):4587 - 4618
Cited by:  Papers (64)
| | PDF (692 KB) | HTML

Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distillation, etc., which characterize asymptotic properties of quantum and classical channels and states. In this paper, we advocate a unified approach to an important class of problems in quantum Shannon theory, consisting of ... View full abstract»

• ### Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness

Publication Year: 2008, Page(s):4619 - 4637
Cited by:  Papers (81)
| | PDF (473 KB) | HTML

There is a difference between the optimal rates of fixed-length source coding and intrinsic randomness when we care about the second-order asymptotics. We prove this difference for general information sources and then investigate independent and identically distributed (i.i.d.) random variables and Markovian variables as examples. The difference is demonstrated through an investigation of the seco... View full abstract»

• ### Source Coding With Distortion Side Information

Publication Year: 2008, Page(s):4638 - 4665
Cited by:  Papers (11)
| | PDF (858 KB) | HTML

The impact of side information about the distortion measure in problems of quantization is analyzed. It is shown that such "distortion side information" is not only useful in general, but that in many cases knowing it at only the encoder is as good as knowing it at both encoder and decoder, and knowing it at only the decoder is useless. Moreover, it is shown that the strategy of exploiting distort... View full abstract»

• ### Successive Refinement for Hypothesis Testing and Lossless One-Helper Problem

Publication Year: 2008, Page(s):4666 - 4681
Cited by:  Papers (11)
| | PDF (394 KB) | HTML

We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H0:PXY against H1: PXPY, i.e., test against independence is considered. One remote sensor collects data stream X and sends summary information, constrained by SR coding rates, to a decision cente... View full abstract»

• ### A Comment on the Weiss–Weinstein Bound for Constrained Parameter Sets

Publication Year: 2008, Page(s):4682 - 4684
Cited by:  Papers (6)
| | PDF (137 KB) | HTML

The Weiss-Weinstein bound (WWB) provides a lower limit on the mean-squared error (MSE) achievable by an estimator of an unknown random parameter. In this correspondence, it is shown that some previously proposed simplified versions of the bound do not always hold for constrained parameters, i.e., parameters whose distribution has finite support. These simplifications can produce results which are ... View full abstract»

• ### Results of the Enumeration of Costas Arrays of Order $27$

Publication Year: 2008, Page(s):4684 - 4687
Cited by:  Papers (21)
| | PDF (245 KB) | HTML

This correspondence presents the results of the enumeration of Costas arrays of order 27: all arrays found, except for one, are accounted for by the Golomb and Welch construction methods. View full abstract»

• ### On the Secrecy Capacity of Fading Channels

Publication Year: 2008, Page(s):4687 - 4698
Cited by:  Papers (603)  |  Patents (1)
| | PDF (762 KB) | HTML

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the trans... View full abstract»

• ### Capacity Achieving LDPC Codes Through Puncturing

Publication Year: 2008, Page(s):4698 - 4706
Cited by:  Papers (36)  |  Patents (2)
| | PDF (367 KB) | HTML

The performance of punctured low-definition parity-check (LDPC) codes under maximum-likelihood (ML) decoding is studied in this correspondence via deriving and analyzing their average weight distributions (AWDs) and the corresponding asymptotic growth rate of the AWDs. In particular, it is proved that capacity-achieving codes of any rate and for any memoryless binary-input output-symmetric (MBIOS)... View full abstract»

• ### On the Achievable Rate Regions for Interference Channels With Degraded Message Sets

Publication Year: 2008, Page(s):4707 - 4712
Cited by:  Papers (49)
| | PDF (353 KB) | HTML

The interference channel with degraded message sets (IC-DMS) refers to a communication model, in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one sender has complete and a priori (noncausal) knowledge about the message being transmitted by the other. A coding scheme that collectively has advantages of cooperative coding, colla... View full abstract»

• ### On the Capacity and Design of Limited Feedback Multiuser MIMO Uplinks

Publication Year: 2008, Page(s):4712 - 4724
Cited by:  Papers (9)
| | PDF (1584 KB) | HTML

The theory of multiple-input-multiple-output (MIMO) technology has been well developed to increase fading channel capacity over single-input-single-output (SISO) systems. This capacity gain can often be leveraged by utilizing channel state information at the transmitter and the receiver. Users make use of this channel state information for transmit signal adaptation. In this correspondence, we der... View full abstract»

• ### Construction of Capacity Achieving $(M, d, \infty)$ Constrained Codes With Least Decoder Window Length

Publication Year: 2008, Page(s):4724 - 4726
| | PDF (119 KB) | HTML

We present capacity achieving multilevel run-length-limited (ML-RLL) codes that can be decoded by a sliding window of size 2. 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