# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 40

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

Publication Year: 2007, Page(s): C2
| PDF (38 KB)
• ### Representation of Mutual Information Via Input Estimates

Publication Year: 2007, Page(s):453 - 470
Cited by:  Papers (31)
| | PDF (743 KB) | HTML

A relationship between information theory and estimation theory was recently shown for the Gaussian channel, relating the derivative of mutual information with the minimum mean-square error. This paper generalizes the link between information theory and estimation theory to arbitrary channels, giving representations of the derivative of mutual information as a function of the conditional marginal ... View full abstract»

• ### On Capacity Under Receive and Spatial Spectrum-Sharing Constraints

Publication Year: 2007, Page(s):471 - 487
Cited by:  Papers (318)
| | PDF (461 KB) | HTML

Capacity is often studied under constraints on the channel input signals. This paper investigates the behavior of capacity when constraints are placed on the channel output signal (as well as generalizations thereof). While such a change in perspective leaves the point-to-point problem (essentially) unchanged, the main conclusion is that in certain network scenarios, including multiple-access and ... View full abstract»

Publication Year: 2007, Page(s):488 - 501
Cited by:  Papers (30)
| | PDF (1148 KB) | HTML

We build on Zheng and Tse's elegant formulation of diversity-multiplexing tradeoff (DMT) to provide a better understanding of the asymptotic interplay between transmission rate, error probability, and signal-to-noise ratio (SNR) in block-fading multiple-input multiple-output (MIMO) channels. In particular, we identify the limitation imposed by the notion of multiplexing gain and develop a new form... View full abstract»

• ### On the Ergodic Capacity of Rank-$1$Ricean-Fading MIMO Channels

Publication Year: 2007, Page(s):502 - 517
Cited by:  Papers (85)
| | PDF (551 KB) | HTML

This paper investigates the ergodic capacity of Ricean-fading multiple-input-multiple-output (MIMO) channels with rank-1 mean matrices under the assumption that the channel is unknown at the transmitter and perfectly known at the receiver. After introducing the system model and the concept of ergodic capacity of MIMO channels, we derive the explicit expressions for the expected values of the deter... View full abstract»

• ### Communicating Probability Distributions

Publication Year: 2007, Page(s):518 - 525
Cited by:  Papers (22)
| | PDF (267 KB) | HTML

A rate distortion problem is solved that is motivated by a quantum data compression problem. The goal is to send information about a source string x so that a receiver can construct a second string y for which the joint empirical probability distribution of x and y is close to some desired distribution. The problem differs from the usual rate distortion problems in that one must consider both remo... View full abstract»

• ### Classical Capacity of Classical-Quantum Arbitrarily Varying Channels

Publication Year: 2007, Page(s):526 - 533
Cited by:  Papers (21)
| | PDF (241 KB) | HTML

We prove that the average error classical capacity C(W) of a classicalquantum arbitrarily varying channel (cq-AVC) W equals 0 or else the random code capacity C (Ahlswede's dichotomy). We also establish a necessary and sufficient condition for C(W)&gt;0 View full abstract»

• ### An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses

Publication Year: 2007, Page(s):534 - 549
Cited by:  Papers (51)
| | PDF (468 KB) | HTML

The information-spectrum analysis made by Han for classical hypothesis testing for simple hypotheses is extended to a unifying framework including both classical and quantum hypothesis testing. The results are also applied to fixed-length source coding when loosening the normalizing condition for probability distributions and for quantum states. We establish general formulas for several quantities... View full abstract»

• ### Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications

Publication Year: 2007, Page(s):550 - 579
Cited by:  Papers (23)
| | PDF (846 KB) | HTML

The moderate complexity of low-density parity-check (LDPC) codes under iterative decoding is attributed to the sparseness of their parity-check matrices. It is therefore of interest to consider how sparse parity-check matrices of binary linear block codes can be a function of the gap between their achievable rates and the channel capacity. This issue was addressed by Sason and Urbanke, and it is r... View full abstract»

• ### On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications

Publication Year: 2007, Page(s):580 - 598
Cited by:  Papers (14)
| | PDF (585 KB) | HTML

A variety of communication scenarios can be modeled by a set of parallel channels. Upper bounds on the achievable rates under maximum-likelihood (ML) decoding, and lower bounds on the decoding complexity per iteration of ensembles of low-density parity-check (LDPC) codes are presented. The communication of these codes is assumed to take place over statistically independent parallel channels where ... View full abstract»

• ### Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques

Publication Year: 2007, Page(s):599 - 614
Cited by:  Papers (63)  |  Patents (2)
| | PDF (449 KB) | HTML

This paper first introduces an improved decoding algorithm for low-density parity-check (LDPC) codes over binary-input-output-symmetric memoryless channels. Then some fundamental properties of punctured LDPC codes are presented. It is proved that for any ensemble of LDPC codes, there exists a puncturing threshold. It is then proved that for any rates R<sub>1</sub> and R<sub>2<... View full abstract»

• ### Improved Analysis of List Decoding and Its Application to Convolutional Codes and Turbo Codes

Publication Year: 2007, Page(s):615 - 627
Cited by:  Papers (5)  |  Patents (2)
| | PDF (962 KB) | HTML

A list decoder generates a list of more than one codeword candidates, and decoding is erroneous if the transmitted codeword is not included in the list. This decoding strategy can be implemented in a system that employs an inner error correcting code and an outer error detecting code that is used to choose the correct codeword from the list. Probability of codeword error analysis for a linear bloc... View full abstract»

• ### A Successive Decoding Strategy for Channels With Memory

Publication Year: 2007, Page(s):628 - 646
Cited by:  Papers (32)
| | PDF (596 KB) | HTML

This paper presents a new technique for communication over channels with memory where the channel state is unknown at the transmitter and receiver. A deep interleaver combined with successive decoding decomposes a channel with memory into an array of parallel memoryless channels on which a conventional coding system can operate individually. The problems of joint channel estimation and decoding th... View full abstract»

• ### Optimal Space&ndash;Time Codes for the MIMO Amplify-and-Forward Cooperative Channel

Publication Year: 2007, Page(s):647 - 663
Cited by:  Papers (169)  |  Patents (1)
| | PDF (721 KB) | HTML

In this work, we extend the nonorthogonal amplify-and-forward (NAF) cooperative diversity scheme to the multiple-input multiple-output (MIMO) channel. A family of space-time block codes for a half-duplex MIMO NAF fading cooperative channel with N relays is constructed. The code construction is based on the nonvanishing determinant (NVD) criterion and is shown to achieve the optimal diversity-multi... View full abstract»

• ### Griffith&ndash;Kelly&ndash;Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes

Publication Year: 2007, Page(s):664 - 683
Cited by:  Papers (27)
| | PDF (524 KB) | HTML

It is shown that a correlation inequality of statistical mechanics can be applied to linear low-density parity-check codes. Thanks to this tool we prove that, under a natural assumption, the exponential growth rate of regular low-density parity-check (LDPC) codes, can be computed exactly by iterative methods, at least on the interval where it is a concave function of the relative weight of code wo... View full abstract»

• ### New Gallager Bounds in Block-Fading Channels

Publication Year: 2007, Page(s):684 - 694
Cited by:  Papers (10)
| | PDF (341 KB) | HTML

In this paper, we propose a new upper bound on the error performance of binary linear codes over block-fading channels by employing Gallager's first- and second-bounding techniques. As the proposed bound is numerically intensive in its general form, we consider two special cases, namely, the spherical bound and the DS2-exponential bound, which are found to be tight in nonergodic and near-ergodic b... View full abstract»

• ### Centralized Wireless Data Networks With User Arrivals and Departures

Publication Year: 2007, Page(s):695 - 713
Cited by:  Papers (13)
| | PDF (481 KB) | HTML

A dynamic-user model for centralized wireless networks is studied, where users arrive with a certain file size and depart when the file is served by a central server. Although the exact analysis of dynamic-user systems can be complicated, it is shown that an approximate analysis can be performed in a time-scale separation regime where the file size is much larger than the time scale of service pro... View full abstract»

• ### Lattice Quantization With Side Information: Codes, Asymptotics, and Applications in Sensor Networks

Publication Year: 2007, Page(s):714 - 731
Cited by:  Papers (19)
| | PDF (739 KB) | HTML

In this paper, we consider the problem of rate/distortion with side information available only at the decoder. For the case of jointly Gaussian source X and side information Y, and mean-squared error distortion, Wyner proved in 1976 that the rate/distortion function for this problem is identical to the conditional rate/distortion function R <sub>X|Y</sub>, assuming the side information... View full abstract»

• ### Achieving Wireline Random Access Throughput in Wireless Networking Via User Cooperation

Publication Year: 2007, Page(s):732 - 758
Cited by:  Papers (7)
| | PDF (1124 KB) | HTML

Well appreciated at the physical layer, user cooperation is introduced here as a diversity enabler for wireless random access (RA) at the medium access control sublayer. This is accomplished through a two-phase protocol in which active users start with a low power transmission attempting to reach nearby users and follow up with a high power transmission in cooperation with the users recruited in t... View full abstract»

• ### Multicollision Attacks on Some Generalized Sequential Hash Functions

Publication Year: 2007, Page(s):759 - 767
Cited by:  Papers (16)  |  Patents (1)
| | PDF (257 KB) | HTML

A multicollision for a function is a set of inputs whose outputs are all identical. A. Joux showed multicollision attacks on the classical iterated hash function. He also showed how these multicollision attacks can be used to get a collision attack on a concatenated hash function. In this paper, we study multicollision attacks in a more general class of hash functions which we term "generalized se... View full abstract»

• ### Irreducible Polynomials Which Divide Trinomials Over GF$\,(2)$

Publication Year: 2007, Page(s):768 - 774
Cited by:  Papers (3)
| | PDF (277 KB) | HTML

The simplest linear shift registers to generate binary sequences involve only two taps, which corresponds to a trinomial over GF(2). It is therefore of interest to know which irreducible polynomials f(x) divide trinomials over GF(2), since the output sequences corresponding to f(x) can be obtained from a two-tap linear feedback shift register (with a suitable initial state) if and only if f(x) div... View full abstract»

• ### An Algebraic Approach to Link Failures Based on Network Coding

Publication Year: 2007, Page(s):775 - 779
Cited by:  Papers (7)
| | PDF (248 KB) | HTML

In this correspondence, we investigate the link failure problem based on the recent results of network coding. We propose a concept, named capacity factor of a network, which is the minimum link set that can influence the network capacity, as our basic tool. We define the capacity rank to each link of the network to characterize its criticality and present the concept of the p-stable network. Base... View full abstract»

• ### On the Convexity of Feasible QoS Regions

Publication Year: 2007, Page(s):779 - 783
Cited by:  Papers (16)
| | PDF (249 KB) | HTML

The feasible quality-of-service (QoS) region is the set of all QoS vectors that can be provided to the users by means of power control, with interference treated as noise. In an interference-limited scenario, this set is determined by the Perron root of some QoS-dependent nonnegative matrix. In a previous work, we showed that if the signal-to-interference ratio (SIR) is a log-convex function of th... View full abstract»

• ### A Posteriori Probability Distances Between Finite-Alphabet Hidden Markov Models

Publication Year: 2007, Page(s):783 - 793
Cited by:  Papers (2)
| | PDF (480 KB) | HTML

In this correspondence, we consider a probability distance problem for a class of hidden Markov models (HMMs). The notion of conditional relative entropy between conditional probability measures is introduced as an a posteriori probability distance which can be used to measure the discrepancy between hidden Markov models when a realized observation sequence is observed. Using a measure change tech... 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