By Topic

# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 44

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

Publication Year: 2009, Page(s): C2
| PDF (41 KB)
• ### Two Batch Search With Lie Cost

Publication Year: 2009, Page(s):1433 - 1439
Cited by:  Papers (3)
| | PDF (193 KB) | HTML

We consider the problem of searching for an unknown number in the search space U ={0,...,M-1}. q-ary questions can be asked and some of the answers may be wrong. An arbitrary integer weighted bipartite graph Gamma is given, stipulating the cost Gamma(i,j) of each answer jnei when the correct answer is i, i.e., the cost of a wrong answer. Correct answers are supposed to be cost-less. It is assumed ... View full abstract»

• ### Exact Characterization of the Minimax Loss in Error Exponents of Universal Decoders

Publication Year: 2009, Page(s):1440 - 1459
| | PDF (442 KB) | HTML

Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMCs) and various ensembles of random codes, are studied by combining the competitive minimax approach, proposed by Feder and Merhav, with Chernoff bound and Gallager's techniques for the analysis of error exponents. In particular, we derive a single-letter expression for ... View full abstract»

• ### On the Entropy Rate of Hidden Markov Processes Observed Through Arbitrary Memoryless Channels

Publication Year: 2009, Page(s):1460 - 1467
Cited by:  Papers (8)
| | PDF (467 KB) | HTML

This paper studies the entropy rate of hidden Markov processes (HMPs) which are generated by observing a discrete-time binary homogeneous Markov chain through an arbitrary memoryless channel. A fixed-point functional equation is derived for the stationary distribution of an input symbol conditioned on all past observations. While the existence of a solution to the fixed-point functional equation i... View full abstract»

• ### Linear-Codes-Based Lossless Joint Source-Channel Coding for Multiple-Access Channels

Publication Year: 2009, Page(s):1468 - 1486
Cited by:  Papers (7)
| | PDF (430 KB) | HTML

A general lossless joint source-channel coding (JSCC) scheme based on linear codes and random interleavers for multiple-access channels (MACs) is presented and then analyzed in this paper. By the information-spectrum approach and the code-spectrum approach, it is shown that a linear code with a good joint spectrum can be used to establish limit-approaching lossless JSCC schemes for correlated gene... View full abstract»

• ### Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems

Publication Year: 2009, Page(s):1487 - 1518
Cited by:  Papers (3)
| | PDF (820 KB) | HTML

We study the transmission of two discrete memoryless correlated sources, consisting of a common and a private source, over a discrete memoryless multiterminal channel with two transmitters and two receivers. At the transmitter side, the common source is observed by both encoders but the private source can only be accessed by one encoder. At the receiver side, both decoders need to reconstruct the ... View full abstract»

• ### Reed–Solomon and Simplex Codes for Peak-to-Average Power Ratio Reduction in OFDM

Publication Year: 2009, Page(s):1519 - 1528
Cited by:  Papers (22)
| | PDF (884 KB) | HTML

New schemes for peak-to-average power ratio reduction in orthogonal frequency-division multiplexing (OFDM) systems are proposed. Reed-Solomon (RS) and simplex codes are employed to create a number of candidates, from which the best are selected. Thereby, in contrast to existing approaches, the codes are arranged over a number of OFDM frames rather than over the carriers, hence a combination of the... View full abstract»

• ### Quantifying the Loss of Compress–Forward Relaying Without Wyner–Ziv Coding

Publication Year: 2009, Page(s):1529 - 1533
Cited by:  Papers (21)
| | PDF (187 KB) | HTML

The compress-and-forward (CF) strategy achieves the optimal diversity-multiplexing tradeoff (DMT) of a three-node half-duplex relay network in slow fading, under the assumption that the relay has perfect knowledge of all three channel coefficients and that the relay makes use of Wyner-Ziv (WZ) source coding with side information. This paper studies the achievable DMT of the same network when the r... View full abstract»

• ### On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications

Publication Year: 2009, Page(s):1534 - 1554
Cited by:  Papers (5)
| | PDF (535 KB) | HTML

In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular, we are interested in an uplink cellular channel which models mobile users experiencing a soft-handoff situation under joint multicell decoding. Considering rather general fading statistics we provide a closed-form expression... View full abstract»

• ### Low-SNR Capacity of Noncoherent Fading Channels

Publication Year: 2009, Page(s):1555 - 1574
Cited by:  Papers (25)
| | PDF (407 KB) | HTML

Discrete-time Rayleigh-fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter or the receiver. The fading is assumed to be stationary and correlated in time, but independent from antenna to antenna. Peak-power and average-power constraints are imposed on the transmit antennas. For MIMO channel... View full abstract»

• ### On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels

Publication Year: 2009, Page(s):1575 - 1591
Cited by:  Papers (67)  |  Patents (1)
| | PDF (1003 KB) | HTML

The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransmission request (HARQ) protocol is revisited for a block-fading wiretap channel. Here, two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who in... View full abstract»

• ### Performance Analysis and Design Criteria of BICM-ID With Signal Space Diversity for Keyhole Nakagami-$m$ Fading Channels

Publication Year: 2009, Page(s):1592 - 1602
Cited by:  Papers (8)
| | PDF (422 KB) | HTML

This paper generalizes the application bit-interleaved coded modulation with iterative decoding (BICM-ID) using signal space diversity (SSD) over keyhole Nakagami-m fading channels. The tight union bound on the asymptotic error performance is first analytically derived. The near-optimal rotation matrix with respect to both the asymptotic performance and the convergence behavior is th... View full abstract»

• ### Information Theoretic Bounds for Compound MIMO Gaussian Channels

Publication Year: 2009, Page(s):1603 - 1617
Cited by:  Papers (7)
| | PDF (515 KB) | HTML

In this paper, achievable rates for compound Gaussian multiple-input-multiple-output (MIMO) channels are derived. Two types of channels, modeled in the frequency domain, are considered when: 1) the channel frequency response matrix H belongs to a subset of H infin normed linear space, and 2) the power spectral density (PSD) matrix of the Gaussian noise belongs to a subset ... View full abstract»

• ### Diversity Gains of Power Control With Noisy CSIT in MIMO Channels

Publication Year: 2009, Page(s):1618 - 1626
Cited by:  Papers (20)
| | PDF (299 KB) | HTML

A multi antenna channel with partial channel state information at the transmitter (CSIT) is studied. The partial CSIT takes the form of the channel matrix corrupted by additive white Gaussian noise (AWGN) with a variance that is assumed to decay as a power of the signal-to-noise ratio (SNR). It is shown that under a long-term power constraint and in the regime of asymptotically high SNR, a large d... View full abstract»

• ### Orthogonal space-time block codes with sphere packing

Publication Year: 2009, Page(s):1627 - 1639
Cited by:  Papers (2)
| | PDF (477 KB) | HTML

Orthogonal designs have received considerable attention in the development of efficient modulation and coding methods for future multi-antenna wireless communication systems due to their special properties. In this paper, we propose a class of space-time block codes constructed by combining orthogonal designs with sphere packing for an arbitrary number of transmit antennas. The structure of the or... View full abstract»

• ### Robust Precoder Adaptation for MIMO Links With Noisy Limited Feedback

Publication Year: 2009, Page(s):1640 - 1649
Cited by:  Papers (8)
| | PDF (728 KB) | HTML

In this paper, we propose two robust limited feedback designs for multiple-input multiple-output (MIMO) adaptation. The first scheme, namely, the combined design jointly optimizes the adaptation, CSIT (channel state information at the transmitter) feedback as well as index assignment strategies. The second scheme, namely, the decoupled design, focuses on the index assig... View full abstract»

• ### Random Sensory Networks: A Delay Analysis

Publication Year: 2009, Page(s):1650 - 1664
Cited by:  Papers (4)
| | PDF (722 KB) | HTML

A fundamental function performed by a sensory network is the retrieval of data gathered collectively by sensor nodes. The metrics that measure the efficiency of this data collection process are time and energy. In this paper, we study via simple discrete mathematical models, the statistics of the data collection time in sensory networks. Specifically, we analyze the average minimum delay in collec... View full abstract»

• ### Performance Analysis of Contention Based Medium Access Control Protocols

Publication Year: 2009, Page(s):1665 - 1682
Cited by:  Papers (35)
| | PDF (594 KB) | HTML

This paper studies the performance of contention based medium access control (MAC) protocols. In particular, a simple and accurate technique for estimating the throughput of the IEEE 802.11 DCF protocol is developed. The technique is based on a rigorous analysis of the Markov chain that corresponds to the time evolution of the back-off processes at the contending nodes. An extension of the techniq... View full abstract»

• ### Analysis of Optimal High Resolution and Fixed Rate Scalar Quantization

Publication Year: 2009, Page(s):1683 - 1691
Cited by:  Papers (3)
| | PDF (219 KB) | HTML

In 2001, Hui and Neuhoff proposed a uniform quantizer with overload for the quantization of scalar signals and derived the asymptotically optimal size of the quantization bins in the high-bitrate limit. The purpose of the present paper is to prove a quantitatively more precise version of this result which, at the same time, is valid for a more general, quite natural cla... View full abstract»

• ### On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources

Publication Year: 2009, Page(s):1692 - 1695
| | PDF (121 KB) | HTML

Given a discrete memoryless source X, it is well known that the expected codeword length per symbol L n(X) of an optimal prefix code for the extended source X n converges to the source entropy as n approaches infinity. However, the sequence L n(X) need not be monotonic in n , which implies that the coding effi... View full abstract»

• ### The Construction of Variable Length Codes With Good Synchronization Properties

Publication Year: 2009, Page(s):1696 - 1700
Cited by:  Patents (1)
| | PDF (217 KB) | HTML

Variable length codes offer advantages for data compression, but are susceptible to loss of synchronization if a bit error occurs. This can be mitigated by the use of variable length codes with specific mechanisms for resynchronization. Such mechanisms exist in the codes known as Huffman Equivalent (HE) codes and T-codes. These have been extensively studied in the literature. For optimal compressi... View full abstract»

• ### New Results on Multiple Descriptions in the Wyner-Ziv Setting

Publication Year: 2009, Page(s):1701 - 1708
Cited by:  Papers (1)
| | PDF (185 KB) | HTML

Some new results of multiple descriptions in the Wyner-Ziv setting (MDWZ) are presented. MDWZ uses two pieces of side information (SI) for two different side decoders. Both SI are available to the central decoder, but none to the encoder. The complete achievable region for a quadratic Gaussian MDWZ system is derived. This result is an extension of Ozarow's result on multiple descriptions of a Gaus... View full abstract»

• ### On Practical Design for Joint Distributed Source and Network Coding

Publication Year: 2009, Page(s):1709 - 1720
Cited by:  Papers (23)
| | PDF (752 KB) | HTML

This paper considers the problem of communicating correlated information from multiple source nodes over a network of noiseless channels to multiple destination nodes, where each destination node wants to recover all sources. The problem involves a joint consideration of distributed compression and network information relaying. Although the optimal rate region has been theoretically characterized,... View full abstract»

• ### Cyclic Lowest Density MDS Array Codes

Publication Year: 2009, Page(s):1721 - 1729
Cited by:  Papers (33)
| | PDF (251 KB) | HTML

Three new families of lowest density maximum-distance separable (MDS) array codes are constructed, which are cyclic or quasi-cyclic. In addition to their optimal redundancy (MDS) and optimal update complexity (lowest density), the symmetry offered by the new codes can be utilized for simplified implementation in storage applications. The proof of the code properties has an indirect structure: firs... 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