# 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)
• ### The Necessity and Sufficiency of Anytime Capacity for Stabilization of a Linear System Over a Noisy Communication Link&#8212;Part I: Scalar Systems

Publication Year: 2006, Page(s):3369 - 3395
Cited by:  Papers (183)
| | PDF (734 KB) | HTML

In this paper, we review how Shannon's classical notion of capacity is not enough to characterize a noisy communication channel if the channel is intended to be used as part of a feedback loop to stabilize an unstable scalar linear system. While classical capacity is not enough, another sense of capacity (parametrized by reliability) called "anytime capacity" is necessary for the stabilization of ... View full abstract»

• ### Information Theory and Mixing Least-Squares Regressions

Publication Year: 2006, Page(s):3396 - 3410
Cited by:  Papers (49)
| | PDF (397 KB) | HTML

For Gaussian regression, we develop and analyze methods for combining estimators from various models. For squared-error loss, an unbiased estimator of the risk of the mixture of general estimators is developed. Special attention is given to the case that the component estimators are least-squares projections into arbitrary linear subspaces, such as those spanned by subsets of explanatory variables... View full abstract»

• ### Statistical and Information-Theoretic Analysis of Resolution in Imaging

Publication Year: 2006, Page(s):3411 - 3437
Cited by:  Papers (20)
| | PDF (1367 KB) | HTML

In this paper, some detection-theoretic, estimation-theoretic, and information-theoretic methods are investigated to analyze the problem of determining resolution limits in imaging systems. The canonical problem of interest is formulated based on a model of the blurred image of two closely spaced point sources of unknown brightness. To quantify a measure of resolution in statistical terms, the fol... View full abstract»

• ### An Invariant Bayesian Model Selection Principle for Gaussian Data in a Sparse Representation

Publication Year: 2006, Page(s):3438 - 3455
Cited by:  Papers (2)
| | PDF (2451 KB) | HTML

In this paper, we develop a code length principle which is invariant to the choice of parameterization on the model distributions, that is the code length remains the same under smooth transformations on the likelihood parameters. An invariant approximation formula for easy computation of the marginal distribution is provided for Gaussian likelihood models. We provide invariant estimators of the m... View full abstract»

• ### Universal Divergence Estimation for Finite-Alphabet Sources

Publication Year: 2006, Page(s):3456 - 3475
Cited by:  Papers (15)
| | PDF (713 KB) | HTML

This paper studies universal estimation of divergence from the realizations of two unknown finite-alphabet sources. Two algorithms that borrow techniques from data compression are presented. The first divergence estimator applies the Burrows-Wheeler block sorting transform to the concatenation of the two realizations; consistency of this estimator is shown for all finite-memory sources. The second... View full abstract»

• ### Universal Minimax Discrete Denoising Under Channel Uncertainty

Publication Year: 2006, Page(s):3476 - 3497
Cited by:  Papers (9)
| | PDF (639 KB) | HTML

The goal of a denoising algorithm is to recover a signal from its noise-corrupted observations. Perfect recovery is seldom possible and performance is measured under a given single-letter fidelity criterion. For discrete signals corrupted by a known discrete memoryless channel (DMC), the Discrete Universal DEnoiser (DUDE) was recently shown to perform this task asymptotically optimally, without kn... View full abstract»

• ### Simulation-Based Computation of Information Rates for Channels With Memory

Publication Year: 2006, Page(s):3498 - 3508
Cited by:  Papers (279)  |  Patents (2)
| | PDF (362 KB) | HTML

The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum-product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very general channels with memory by means of finite-... View full abstract»

• ### Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices

Publication Year: 2006, Page(s):3509 - 3532
Cited by:  Papers (43)
| | PDF (1104 KB) | HTML

The finite-state Markov channel (FSMC) is a time-varying channel having states that are characterized by a finite-state Markov chain. These channels have infinite memory, which complicates their capacity analysis. We develop a new method to characterize the capacity of these channels based on Lyapunov exponents. Specifically, we show that the input, output, and conditional entropies for this chann... View full abstract»

• ### Robust and Practical Analog-to-Digital Conversion With Exponential Precision

Publication Year: 2006, Page(s):3533 - 3545
Cited by:  Papers (21)  |  Patents (4)
| | PDF (480 KB) | HTML

Beta-encoders with error correction were introduced by Daubechies, DeVore, Guumlntuumlrk and Vaishampayan as an alternative to pulse-code modulation (PCM) for analog-to-digital conversion. An N-bit beta-encoder quantizes a real number by computing one of its N-bit truncated beta-expansions where betaisin(1,2) determines the base of expansion. These encoders have (almost) optimal rate-distortion pr... View full abstract»

• ### Low-Complexity Approaches to Slepian&#8211;Wolf Near-Lossless Distributed Data Compression

Publication Year: 2006, Page(s):3546 - 3561
Cited by:  Papers (33)
| | PDF (474 KB) | HTML

This paper discusses the Slepian-Wolf problem of distributed near-lossless compression of correlated sources. We introduce practical new tools for communicating at all rates in the achievable region. The technique employs a simple "source-splitting" strategy that does not require common sources of randomness at the encoders and decoders. This approach allows for pipelined encoding and decoding so ... View full abstract»

• ### Noisy Cryptographic Protocols for Low-Cost RFID Tags

Publication Year: 2006, Page(s):3562 - 3566
Cited by:  Papers (10)
| | PDF (290 KB) | HTML

Considering some passive eavesdropper, the feasibility of exchanging some secret data between an RFID tag and its reader through public discussion is established. No key distribution is required by our solution; the tag and the reader do not have to share any common data to form a confidential channel. For this, a natural phenomenon-the inherent noise on their communication link-is exploited. Clas... View full abstract»

• ### Unified Large-System Analysis of MMSE and Adaptive Least Squares Receivers for a Class of Random Matrix Channels

Publication Year: 2006, Page(s):3567 - 3600
Cited by:  Papers (11)
| | PDF (1264 KB) | HTML

We present a unified large-system analysis of linear receivers for a class of random matrix channels. The technique unifies the analysis of both the minimum-mean-squared-error (MMSE) receiver and the adaptive least-squares (ALS) receiver, and also uses a common approach for both random independent, identically distributed (i.i.d.) and random orthogonal precoding. We derive expressions for the asym... View full abstract»

• ### The MIMO ARQ Channel: Diversity&#8211;Multiplexing&#8211;Delay Tradeoff

Publication Year: 2006, Page(s):3601 - 3621
Cited by:  Papers (181)  |  Patents (1)
| | PDF (576 KB) | HTML

In this paper, the fundamental performance tradeoff of the delay-limited multiple-input multiple-output (MIMO) automatic retransmission request (ARQ) channel is explored. In particular, we extend the diversity-multiplexing tradeoff investigated by Zheng and Tse in standard delay-limited MIMO channels with coherent detection to the ARQ scenario. We establish the three-dimensional tradeoff between r... View full abstract»

• ### Capacity of Differential Versus Nondifferential Unitary Space&#8211;Time Modulation for MIMO Channels

Publication Year: 2006, Page(s):3622 - 3634
Cited by:  Papers (7)
| | PDF (471 KB) | HTML

Differential unitary space-time modulation (DUSTM) and its earlier nondifferential counterpart, USTM, permit high-throughput multiple-input multiple-output (MIMO) communication entirely without the possession of channel state information by either the transmitter or the receiver. For an isotropically random unitary input we obtain the exact closed-form expression for the probability density of the... View full abstract»

• ### Optimal Superdense Coding of Entangled States

Publication Year: 2006, Page(s):3635 - 3641
Cited by:  Papers (16)
| | PDF (248 KB) | HTML

In this paper, we present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a 2l-qubit quantum state could be communicated to a receiver by physically transmitting only l+o(l) qubits in addition to consuming l ebits of entangleme... View full abstract»

• ### Limits to List Decoding Reed&#8211;Solomon Codes

Publication Year: 2006, Page(s):3642 - 3649
Cited by:  Papers (10)
| | PDF (300 KB) | HTML

In this paper, we prove the following two results that expose some combinatorial limitations to list decoding Reed-Solomon codes. 1) Given n distinct elements alpha1,...,alphan from a field F, and n subsets S1,...,Sn of F, each of size at most l, the list decoding algorithm of Guruswami and Sudan can in polynomial time output all polynomials p of degree ... View full abstract»

• ### Improved Nearly-MDS Expander Codes

Publication Year: 2006, Page(s):3650 - 3661
Cited by:  Papers (12)
| | PDF (376 KB) | HTML

A construction of expander codes is presented with the following three properties: i) the codes lie close to the Singleton bound, ii) they can be encoded in time complexity that is linear in their code length, and iii) they have a linear-time bounded-distance decoder. By using a version of the decoder that corrects also erasures, the codes can replace maximum-distance separable (MDS) outer codes i... View full abstract»

• ### On the Probability of Undetected Error for Overextended Reed&#8211;Solomon Codes

Publication Year: 2006, Page(s):3662 - 3669
Cited by:  Papers (2)
| | PDF (404 KB) | HTML

Upper and lower bounds on the weight distribution of overextended Reed-Solomon (OERS) codes are derived, from which tight upper and lower bounds on the probability of undetected error for OERS codes are obtained for q-ary symmetric channels View full abstract»

• ### On Construction of the$(24, 12, 8)$Golay Codes

Publication Year: 2006, Page(s):3669 - 3675
Cited by:  Papers (5)
| | PDF (316 KB) | HTML

Two product array codes are used to construct the (24,12,8) binary Golay code through the direct sum operation. This construction provides a systematic way to find proper (8,4,4) linear block component codes for generating the Golay code, and it generates and extends previously existing methods that use a similar construction framework. The code constructed is simple to decode View full abstract»

• ### Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$

Publication Year: 2006, Page(s):3676 - 3685
Cited by:  Papers (11)
| | PDF (412 KB) | HTML

There are two kinds of perfect (k-t)-deletion-correcting codes with words of length k over an alphabet of size v, those where the coordinates may be equal and those where all coordinates must be different. We call these two kinds of codes T*(t,k,v)-codes and T(t,k,v)-codes respectively. Both a T*(t,k,v)-code and a T(t,k,v)-code are capable of correcting any combination of up to (k-t) deletions and... View full abstract»

• ### A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings

Publication Year: 2006, Page(s):3685 - 3695
Cited by:  Papers (18)
| | PDF (567 KB) | HTML

A new general upper bound is derived on the sum of the Hamming distances between sequences when mapping from one set of sequences to another. It is shown that a similar upper bound for mappings from binary sequences to permutation sequences is a special case of this upper bound and this is used to evaluate known mappings. Also, new distance-preserving mappings (DPMs) from binary sequences to permu... View full abstract»

• ### Improving the Alphabet-Size in Expander-Based Code Constructions

Publication Year: 2006, Page(s):3695 - 3700
| | PDF (323 KB) | HTML

Various code constructions use expander graphs to improve the error resilience. Often the use of expanding graphs comes at the expense of the alphabet size. In this correspondence, we show that by replacing the balanced expanding graphs used in the above constructions with unbalanced dispersers the alphabet size can be dramatically improved View full abstract»

• ### A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set

Publication Year: 2006, Page(s):3700 - 3706
Cited by:  Papers (14)
| | PDF (410 KB) | HTML

A new lower bound for the distance of cyclic codes is proposed. This bound depends on the defining set of the code, like several other bounds. The proposed bound improves upon the Bose-Chaudhuri-Hocquehghen (BCH) bound and, for some codes, improves upon the Hartmann-Tzeng bound and the Roos bound as well 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