Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 54

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

Publication Year: 2008, Page(s): C2
| PDF (41 KB)
• ### Robust Distributed Source Coding

Publication Year: 2008, Page(s):3385 - 3398
Cited by:  Papers (27)
| | PDF (328 KB) | HTML

We consider a distributed source coding system in which several observations must be encoded separately and communicated to the decoder by using limited transmission rate. We introduce a robust distributed coding scheme which flexibly trades off between system robustness and compression efficiency. The optimality of this coding scheme is proved for various special cases. View full abstract»

• ### Distortion Control for Delay-Sensitive Sources

Publication Year: 2008, Page(s):3399 - 3411
Cited by:  Papers (4)
| | PDF (557 KB) | HTML

We investigate the problem of finding minimum-distortion policies for streaming delay-sensitive but distortion-tolerant data. We consider cross-layer approaches which exploit the coupling between presentation and transport layers. We make the natural assumption that the distortion function is convex and decreasing. We focus on a single source-destination pair and analytically find the optimum tran... View full abstract»

• ### More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding

Publication Year: 2008, Page(s):3412 - 3424
Cited by:  Papers (7)
| | PDF (424 KB) | HTML

There is a large literature devoted to the problem of finding an optimal (min-cost) prefix-free code with an unequal letter-cost encoding alphabet of size. While there is no known polynomial time algorithm for solving it optimally, there are many good heuristics that all provide additive errors to optimal. The additive error in these algorithms usually depends linearly upon the largest encoding le... View full abstract»

• ### Interference Alignment and Degrees of Freedom of the$K$-User Interference Channel

Publication Year: 2008, Page(s):3425 - 3441
Cited by:  Papers (2067)  |  Patents (39)
| | PDF (422 KB) | HTML

For the fully connected K user wireless interference channel where the channel coefficients are time-varying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR)=K/2log(SNR)+o(log(SNR)) . Thus, the K user time-varying interference channel almost surely has K/2 degrees of freedom. Achievability is based on the idea of interference alignment. Examples are also pr... View full abstract»

• ### Fundamental Limits of Linear Equalizers: Diversity, Capacity, and Complexity

Publication Year: 2008, Page(s):3442 - 3456
Cited by:  Papers (37)
| | PDF (1540 KB) | HTML

Linear equalizers (LEs) have been widely adopted for practical systems due to their low computational complexity. However, it is also well known that LEs provide inferior performance relative to a maximum-likelihood equalizer (MLE) or other near-MLEs, because LEs usually cannot collect the diversity order enabled by the transmitter and at the same time they lose mutual information. More importantl... View full abstract»

• ### Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis

Publication Year: 2008, Page(s):3457 - 3470
Cited by:  Papers (655)  |  Patents (21)
| | PDF (518 KB) | HTML

In a multiple-antenna system with two transmitters and two receivers, a scenario of data communication, known as the X channel, is studied in which each receiver receives data from both transmitters. In this scenario, it is assumed that each transmitter is unaware of the other transmitter's data (noncooperative scenario). This system can be considered as a combination of two broadcast channels (fr... View full abstract»

• ### Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels

Publication Year: 2008, Page(s):3471 - 3489
Cited by:  Papers (99)  |  Patents (3)
| | PDF (628 KB) | HTML

This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we formulate this power control problem as a (generalized) Nash equilibrium (NE) game. We obtain sufficient conditions that guarantee the existence and nonemptiness of t... View full abstract»

• ### Asymptotic Mutual Information Statistics of Separately Correlated Rician Fading MIMO Channels

Publication Year: 2008, Page(s):3490 - 3504
Cited by:  Papers (39)  |  Patents (3)
| | PDF (942 KB) | HTML

The asymptotic probability distribution of the mutual information of a separately correlated Rician fading multiple-input multiple-output (MIMO) channel is addressed. The mean and variance of the mutual information are derived when the number of transmit and receive antennas grows asymptotically large while their ratio approaches a finite constant. This derivation is based on the <i>replica&... View full abstract»

• ### Large Deviations of the Interference in a Wireless Communication Model

Publication Year: 2008, Page(s):3505 - 3517
Cited by:  Papers (18)
| | PDF (274 KB) | HTML

<para> Interference from other users limits the capacity, and possibly the connectivity, of wireless networks. A simple model of a wireless ad hoc network, in which node locations are described by a homogeneous Poisson point process, and node transmission powers are random, is considered in this paper. A large deviation principle for the interference is presented under different assumptions ... View full abstract»

• ### Optimal Cross-Layer Scheduling of Transmissions Over a Fading Multiaccess Channel

Publication Year: 2008, Page(s):3518 - 3537
Cited by:  Papers (26)
| | PDF (534 KB) | HTML

We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the medium access control, link, and physical layers. We assume Markov models for the packet arrival processes and the channel gain processes. Perfect channel state information is assumed to be available at the transmitter and th... View full abstract»

• ### Group Testing for Binary Markov Sources: Data-Driven Group Queries for Cooperative Sensor Networks

Publication Year: 2008, Page(s):3538 - 3551
| | PDF (357 KB) | HTML

Group testing has been used in many applications to efficiently identify rare events in a large population. In this paper, the concept of group testing is generalized to applications with correlated source models to derive scheduling policies for sensors' adopting cooperative transmissions. The tenet of our work is that in a wireless sensor network it is advantageous to allocate the same channel d... View full abstract»

• ### Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three

Publication Year: 2008, Page(s):3552 - 3564
Cited by:  Papers (15)
| | PDF (468 KB) | HTML

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and constant-composition codes. Large classes of group divisible codes are constructed which enabled the determination of the sizes of optimal constant-composition codes ... View full abstract»

• ### Probabilistic Analysis of Linear Programming Decoding

Publication Year: 2008, Page(s):3565 - 3578
Cited by:  Papers (41)
| | PDF (414 KB) | HTML

We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman succeeds in correcting a constant fraction of errors with high probability. The fraction of correctable errors guaranteed by our analysis surpasses previous nonasymptotic results fo... View full abstract»

• ### Coding for Errors and Erasures in Random Network Coding

Publication Year: 2008, Page(s):3579 - 3591
Cited by:  Papers (415)  |  Patents (2)
| | PDF (312 KB) | HTML

The problem of error-control in random linear network coding is considered. A ldquononcoherentrdquo or ldquochannel obliviousrdquo model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer characteristic. Motivated by the property that linear network coding is vector-space preserving, information transmission is modeled as the injection into the n... View full abstract»

• ### Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration

Publication Year: 2008, Page(s):3592 - 3610
Cited by:  Papers (10)
| | PDF (532 KB) | HTML

Since the standard union bound for space-time codes may diverge in quasi-static fading channels, the limit-before-average (LBA) technique has been exploited to derive tight performance bounds. However, it suffers from the computational burden arising from a multidimensional integral. In this paper, efficient bounding techniques for space-time codes are developed in the framework of Gallager bounds... View full abstract»

• ### New List Decoding Algorithms for Reed–Solomon and BCH Codes

Publication Year: 2008, Page(s):3611 - 3630
Cited by:  Papers (35)  |  Patents (2)
| | PDF (921 KB) | HTML

In this paper, we devise a rational curve fitting algorithm and apply it to the list decoding of Reed-Solomon and Bose-Chaudhuri-Hocquenghen (BCH) codes. The resulting list decoding algorithms exhibit the following significant properties. View full abstract»

• ### From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security

Publication Year: 2008, Page(s):3631 - 3646
Cited by:  Papers (13)
| | PDF (430 KB) | HTML

The Fiat-Shamir paradigm for transforming identification schemes into signature schemes has been popular since its introduction because it yields efficient signature schemes, and has been receiving renewed interest of late as the main tool in deriving forward-secure signature schemes. In this paper, minimal (meaning necessary and sufficient) conditions on the identification scheme to ensure securi... View full abstract»

• ### Analysis of the Hash Function Design Strategy Called SMASH

Publication Year: 2008, Page(s):3647 - 3655
Cited by:  Papers (8)
| | PDF (179 KB) | HTML

The hash function design strategy SMASH was recently proposed as an alternative to the MD4 family of hash functions. It can be shown that the strategy leads to designs that are vulnerable to efficient collision and (second) preimage attacks. The mathematical structure of the SMASH description facilitates the description of the weakness and the resulting attacks, but also functions with less mathem... View full abstract»

• ### Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity

Publication Year: 2008, Page(s):3656 - 3662
Cited by:  Papers (16)
| | PDF (247 KB) | HTML

The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the standard algebraic attacks of the pseudorandom generators using it as a nonlinear filtering or combining function. Very few results have been found concerning its relation with the other cryptographic parameters or with the <i&g... View full abstract»

• ### Tardos Fingerprinting is Better Than We Thought

Publication Year: 2008, Page(s):3663 - 3676
Cited by:  Papers (40)  |  Patents (4)
| | PDF (499 KB) | HTML

Tardos has proposed a randomized fingerprinting code that is provably secure against collusion attacks. We revisit his scheme and show that it has significantly better performance than suggested in the original paper. First, we introduce variables in place of Tardos' hard-coded constants and we allow for an independent choice of the desired false positive (FP) and false negative (FN) error rates. ... View full abstract»

• ### Asymptotic Entanglement Manipulation of Bipartite Pure States

Publication Year: 2008, Page(s):3677 - 3686
Cited by:  Papers (10)
| | PDF (233 KB) | HTML

Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement manipulation of an asymptotically large number of copies of the bipartite pure state. In this paper, two different asymptotic measures of entanglement for arbitrary seque... View full abstract»

• ### Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication

Publication Year: 2008, Page(s):3687 - 3692
| | PDF (167 KB) | HTML

A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial <i>f</i> is just any polynomial <i>f</i> + 6<i>g</i>. The 1-a-strong representation of <i>f</i> modulo 6 is polynomial <i>f</i> + 2<i>g</i> + 3<i>h</i>, where no two of <i>g</i>, <i>... View full abstract»

• ### Noise Threshold for Universality of Two-Input Gates

Publication Year: 2008, Page(s):3693 - 3698
Cited by:  Papers (7)
| | PDF (207 KB) | HTML

It is known that epsi-noisy gates with two inputs are universal for arbitrary computation (i.e., can compute any function with bounded error), if all gates fail independently with probability epsi and epsi &lt; beta<sub>2</sub> = (3 - radic7)/4 ap 8.856%. In this paper, it is shown that this bound is tight for formulas, by proving that gates with two inputs, in which each gate fail... 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