# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 37

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

Publication Year: 2009, Page(s): C2
| PDF (42 KB)
• ### Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling

Publication Year: 2009, Page(s):4353 - 4365
Cited by:  Papers (20)
| | PDF (948 KB) | HTML

For a multiple-antenna system, we find a simple and accurate expression for the asymptotic distribution of the antenna selection gain when the transmitter selects the transmit antenna with the strongest channel. We use this to estimate the underlying channel capacity distributions and obtain the approximate ergodic capacity. This estimate is compared with upper and lower bounds. This analysis demo... View full abstract»

• ### On Full Diversity Space–Time Block Codes With Partial Interference Cancellation Group Decoding

Publication Year: 2009, Page(s):4366 - 4385
Cited by:  Papers (65)
| | PDF (501 KB) | HTML

In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for the codes to achieve full diversity when the PIC group decoding is used at the receiver. A PIC group decoding decodes the symbols embedded in an STBC by dividing them into several groups and decoding each group separately ... View full abstract»

• ### BER and Outage Probability Approximations for LMMSE Detectors on Correlated MIMO Channels

Publication Year: 2009, Page(s):4386 - 4397
Cited by:  Papers (9)
| | PDF (1032 KB) | HTML

This paper is devoted to the study of the performance of the linear minimum mean-square error (LMMSE) receiver for (receive) correlated multiple-input multiple-output (MIMO) systems. By the random matrix theory, it is well known that the signal-to-noise ratio (SNR) at the output of this receiver behaves asymptotically like a Gaussian random variable as the number of receive and transmit antennas c... View full abstract»

Publication Year: 2009, Page(s):4398 - 4418
Cited by:  Papers (93)  |  Patents (6)
| | PDF (1352 KB) | HTML

Linear receivers are an attractive low-complexity alternative to optimal processing for multiple-antenna multiple-input multiple-output (MIMO) communications. In this paper, we characterize the information-theoretic performance of MIMO linear receivers in two different asymptotic regimes. For fixed number of antennas, we investigate the limit of error probability in the high-signal-to noise-ratio ... View full abstract»

• ### Distributed MIMO Receiver—Achievable Rates and Upper Bounds

Publication Year: 2009, Page(s):4419 - 4438
Cited by:  Papers (38)  |  Patents (1)
| | PDF (650 KB) | HTML

A multiple-input multiple-output (MIMO) system with a distributed receiver is considered. The system consists of a nomadic transmitter with several antennas, whose signal is received by multiple agents, exhibiting independent channel gains and an additive circular-symmetric Gaussian noise. In the nomadic regime, we assume that the agents do not have any decoding ability. These agents process their... View full abstract»

• ### Novel Constructions of Improved Square Complex Orthogonal Designs for Eight Transmit Antennas

Publication Year: 2009, Page(s):4439 - 4448
Cited by:  Papers (7)
| | PDF (340 KB) | HTML

Constructions of square, maximum rate complex orthogonal space-time block codes (CO STBCs) are well known, however codes constructed via the known methods include numerous zeros, which impede their practical implementation. By modifying the Williamson and Wallis-Whiteman arrays to apply to complex matrices, we propose two methods of construction of square, order-4n CO STBCs from square, order-n co... View full abstract»

• ### On the Capacity of Free-Space Optical Intensity Channels

Publication Year: 2009, Page(s):4449 - 4461
Cited by:  Papers (101)
| | PDF (357 KB) | HTML

Upper and lower bounds are derived on the capacity of the free-space optical intensity channel. This channel has a nonnegative input (representing the transmitted optical intensity), which is corrupted by additive white Gaussian noise. To preserve the battery and for safety reasons, the input is constrained in both its average and its peak power. For a fixed ratio of the allowed average power to t... View full abstract»

• ### A Neyman–Pearson Approach to Universal Erasure and List Decoding

Publication Year: 2009, Page(s):4462 - 4478
Cited by:  Papers (10)
| | PDF (505 KB) | HTML

When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propose a generalization of Csiszar and Korner's maximum mutual information (MMI) decoder with an erasure option for discrete memoryless channels. The new decoder is parameterized by a weighting function that is designed to o... View full abstract»

Publication Year: 2009, Page(s):4479 - 4493
Cited by:  Papers (41)
| | PDF (353 KB) | HTML

Korner and Marton established the capacity region for the two-receiver broadcast channel with degraded message sets. Recent results and conjectures suggest that a straightforward extension of the Korner-Marton region to more than two receivers is optimal. This paper shows that this is not the case. We establish the capacity region for a class of three-receiver broadcast channels with two-degraded ... View full abstract»

• ### Outer Bounds for Multiple-Access Channels With Feedback Using Dependence Balance

Publication Year: 2009, Page(s):4494 - 4507
Cited by:  Papers (7)
| | PDF (395 KB) | HTML

We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple-access channel with noiseless feedback (MAC-FB). We consider a binary additive noisy MAC-FB whose feedback capacity is not known. The binary additive noisy MAC considered in this paper can be viewed as the discrete counterpart of the Gaussian MAC-FB. Ozarow established that... View full abstract»

• ### Communication Under Strong Asynchronism

Publication Year: 2009, Page(s):4508 - 4528
Cited by:  Papers (34)
| | PDF (469 KB) | HTML

A formulation of the problem of asynchronous point-to-point communication is developed. In the system model of interest, the message codeword is transmitted over a channel starting at a randomly chosen time within a prescribed window. The length of the window scales exponentially with the codeword length, where the scaling parameter is referred to as the asynchronism exponent. The receiver knows t... View full abstract»

• ### Capacity Bounds for Broadcast Channels With Confidential Messages

Publication Year: 2009, Page(s):4529 - 4542
Cited by:  Papers (45)
| | PDF (278 KB) | HTML

This paper studies capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while each private message is only for its intended receiver. In addition, each private message is to be kept secret from the unintended receiver where secrecy is measured b... View full abstract»

• ### On the Capacity and Energy Efficiency of Training-Based Transmissions Over Fading Channels

Publication Year: 2009, Page(s):4543 - 4567
Cited by:  Papers (32)
| | PDF (794 KB) | HTML

In this paper, the capacity and energy efficiency of training-based communication schemes employed for transmission over a priori unknown Rayleigh block-fading channels are studied. Initially, the case in which the product of the estimate error and transmitted signal is assumed to be Gaussian noise is considered. In this case, it is shown that bit energy requirements grow without bou... View full abstract»

• ### Cross-Layer Design of FDD-OFDM Systems Based on ACK/NAK Feedbacks

Publication Year: 2009, Page(s):4568 - 4584
Cited by:  Papers (13)
| | PDF (603 KB) | HTML

It is well known that cross-layer scheduling which adapts power, rate and user allocation can achieve significant gain on system capacity. However, conventional cross-layer designs all require channel state information at the base station (CSIT) which is difficult to obtain in practice. In this paper, we focus on cross-layer resource optimization based on ACK/NAK feedback flows in orthogonal frequ... View full abstract»

• ### Achieving Long-Term Fairness and Optimum Multiuser Diversity Gain in Time-Varying Broadcast Channels

Publication Year: 2009, Page(s):4585 - 4597
| | PDF (330 KB) | HTML

In this paper, a downlink system in which a single-antenna base station communicates with k single antenna users over a time-correlated fading channel is considered. It is assumed that each receiver knows its own channel state, while the rate of the channel variation for all users and the corresponding initial fading gains are known to the base station. The average (per channel use) throughput of ... View full abstract»

• ### Mutual Information Games in Multiuser Channels With Correlated Jamming

Publication Year: 2009, Page(s):4598 - 4607
Cited by:  Papers (36)
| | PDF (305 KB) | HTML

We investigate the behavior of two users and one jammer in an additive white Gaussian noise (AWGN) channel with and without fading when they participate in a noncooperative zero-sum game, with the channel's input/output mutual information as the objective function. We assume that the jammer can eavesdrop on the channel and can use the information obtained to perform correlated jamming. We also dif... View full abstract»

• ### Information Theoretic Analysis of Proactive Routing Overhead in Mobile Ad Hoc Networks

Publication Year: 2009, Page(s):4608 - 4625
Cited by:  Papers (7)
| | PDF (807 KB) | HTML

This paper considers basic bounds on the overhead of link-state protocols in mobile ad hoc networks. Hierarchical protocols are known for their good scalability properties, and hence this paper considers a two-level hierarchical protocol. In such protocols, nodes need to keep track of shortest path information, link states and cluster membership. Two types of overheads are considered; the memory n... View full abstract»

• ### Block Pickard Models for Two-Dimensional Constraints

Publication Year: 2009, Page(s):4626 - 4634
Cited by:  Papers (2)
| | PDF (196 KB) | HTML

In Pickard random fields (PRF), the probabilities of finite configurations and the entropy of the field can be calculated explicitly, but only very simple structures can be incorporated into such a field. Given two Markov chains describing a boundary, an algorithm is presented which determines whether a PRF consistent with the distribution on the boundary and a 2-D constraint exists. Iterative sca... View full abstract»

• ### Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes

Publication Year: 2009, Page(s):4635 - 4650
Cited by:  Papers (11)
| | PDF (343 KB) | HTML

Consider communication over a binary-input memoryless output-symmetric channel with low-density parity-check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic formula for the average input-output conditional entropy per bit in the infinite block length limit. Montanari proved a lower bound for this entropy, ... View full abstract»

• ### Heuristic Algorithms for Constructing Binary Constant Weight Codes

Publication Year: 2009, Page(s):4651 - 4656
Cited by:  Papers (8)
| | PDF (295 KB) | HTML

Constant weight binary codes are used in a number of applications. Constructions based on mathematical structure are known for many codes. However, heuristic constructions unrelated to any mathematical structure can become of greater importance when the parameters of the code are larger. This paper considers the problem of finding constant weight codes with the maximum number of codewords from a p... View full abstract»

• ### The Perfect Binary One-Error-Correcting Codes of Length $15$: Part I—Classification

Publication Year: 2009, Page(s):4657 - 4660
Cited by:  Papers (25)
| | PDF (142 KB) | HTML

A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5983 such inequivalent perfect codes and 2165 extended perfect codes. Efficient generation of these codes relies on the recent classification of Steiner quadruple systems of order 16. Utilizing a result of Blackmore, the optimal binary one-error-c... View full abstract»

• ### Multiple-Description Coding by Dithered Delta–Sigma Quantization

Publication Year: 2009, Page(s):4661 - 4675
Cited by:  Papers (23)
| | PDF (400 KB) | HTML

We address the connection between the multiple-description (MD) problem and delta-sigma quantization. The inherent redundancy due to oversampling in delta-sigma quantization, and the simple linear-additive noise model resulting from dithered lattice quantization, allow us to construct a symmetric and time-invariant MD coding scheme. We show that the use of a noise-shaping filter makes it possible ... View full abstract»

• ### Remote Vector Gaussian Source Coding With Decoder Side Information Under Mutual Information and Distortion Constraints

Publication Year: 2009, Page(s):4676 - 4680
Cited by:  Papers (23)
| | PDF (143 KB) | HTML

Let X , Y , Z be zero-mean, jointly Gaussian random vectors of dimensions nx, ny, and nz, respectively. Let P be the set of random variables W such that W harr Y harr (X, Z) is a Markov string. We consider the following optimization problem: WisinP min I(Y; Z) subject to one of the following two possible constraints: 1) I(X; W|Z) ges RI 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