Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 40

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

Publication Year: 2009, Page(s): C2
| PDF (41 KB)
• ### Compound Multiple-Access Channels With Partial Cooperation

Publication Year: 2009, Page(s):2425 - 2441
Cited by:  Papers (44)
| | PDF (377 KB) | HTML

A two-user discrete memoryless compound multiple-access channel (MAC) with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional cooperation, and achievable rate regions are provided for the general case. The results are then extended to the corresponding Gaussian model. In the Gaussian... View full abstract»

• ### On the Loss of Single-Letter Characterization: The Dirty Multiple Access Channel

Publication Year: 2009, Page(s):2442 - 2454
Cited by:  Papers (42)
| | PDF (358 KB) | HTML

For general memoryless systems, the existing information-theoretic solutions have a ldquosingle-letterrdquo form. This reflects the fact that optimum performance can be approached by a random code (or a random binning scheme), generated using independent and identically distributed copies of some scalar distribution. Is that the form of the solution of any (information-theoretic) problem? In fact,... View full abstract»

• ### Capacity Region of the Finite-State Multiple-Access Channel With and Without Feedback

Publication Year: 2009, Page(s):2455 - 2477
Cited by:  Papers (20)
| | PDF (513 KB) | HTML

The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We characterize both an inner and an outer bound for this region, using Massey's directed information. These bounds are shown to coincide, and hence yield the capacity region, of indecomposable FS-MACs without feedback ... View full abstract»

• ### The Capacity of Wireless Networks in Nonergodic Random Fading

Publication Year: 2009, Page(s):2478 - 2493
Cited by:  Papers (8)
| | PDF (566 KB) | HTML

We find the exact per-node capacity scaling in an extended, distributed wireless network where the node locations are random, the channel attenuation between pairs of nodes exhibits independent random fading, and data forwarding is restricted to multihop delivery. We establish a per-node throughput upper bound equal to (Cmax)/(radicn) (bps)/(Hz), and a constructive lower bound equal to ... View full abstract»

• ### On the Capacity of Ad Hoc Networks Under Random Packet Losses

Publication Year: 2009, Page(s):2494 - 2498
Cited by:  Papers (12)
| | PDF (131 KB) | HTML

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the signal to interference and noise ratio (SINR) is above a certain threshold, then the transmitted packet is received error-free by the receiver thereby. Usi... View full abstract»

• ### Network Beamforming Using Relays With Perfect Channel Information

Publication Year: 2009, Page(s):2499 - 2517
Cited by:  Papers (251)
| | PDF (606 KB) | HTML

This paper deals with beamforming in wireless relay networks with perfect channel information at the relays, receiver, and transmitter if there is a direct link between the transmitter and receiver. It is assumed that every node in the network has its own power constraint. A two-step amplify-and-forward protocol is used, in which the transmitter and relays not only use match filters to form a beam... View full abstract»

• ### On Maximizing Coverage in Gaussian Relay Channels

Publication Year: 2009, Page(s):2518 - 2536
Cited by:  Papers (17)
| | PDF (740 KB) | HTML

Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay, and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The new objective captures the problem of how to deploy relays to provide a given level of service to a particular geographic area, where the relay locati... View full abstract»

• ### On Complementary Graph Entropy

Publication Year: 2009, Page(s):2537 - 2546
Cited by:  Papers (1)
| | PDF (229 KB) | HTML

It has been recently discovered that complementary graph entropy characterizes (and offers new insights into) the minimum asymptotic rate for zero-error source coding with decoder side information. This paper presents new results that build on and complement this discovery. Specifically, i) previously unknown subadditivity properties of complementary graph entropy are derived, and ii) zero-error c... View full abstract»

• ### A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap Channel

Publication Year: 2009, Page(s):2547 - 2553
Cited by:  Papers (277)
| | PDF (156 KB) | HTML

The secrecy capacity of the multiple-antenna wiretap channel under the average total power constraint was recently characterized, independently, by Khisti and Wornell and Oggier and Hassibi using a Sato-like argument and matrix analysis tools. This paper presents an alternative characterization of the secrecy capacity of the multiple-antenna wiretap channel under a more general matrix constraint o... View full abstract»

• ### Logarithmic Sobolev Inequalities for Information Measures

Publication Year: 2009, Page(s):2554 - 2561
Cited by:  Papers (13)
| | PDF (207 KB) | HTML

For alpha ges 1, the new Vajda-type information measure J alpha (X) is a quantity generalizing Fisher's information (FI), to which it is reduced for alpha = 2 . In this paper, a corresponding generalized entropy power N alpha (X) is introduced, and the inequality N alpha (X) J View full abstract»

• ### Superposition Coded Modulation With Peak-Power Limitation

Publication Year: 2009, Page(s):2562 - 2576
Cited by:  Papers (18)
| | PDF (437 KB) | HTML

We apply clipping to superposition coded modulation (SCM) systems to reduce the peak-to-average power ratio (PAPR) of the transmitted signal. The impact on performance is investigated by evaluating the mutual information driven by the induced peak-power-limited input signals. It is shown that the rate loss is marginal for moderate clipping thresholds if optimal encoding/decoding is used. This fact... View full abstract»

• ### Pseudocodeword Performance Analysis for LDPC Convolutional Codes

Publication Year: 2009, Page(s):2577 - 2598
Cited by:  Papers (13)
| | PDF (951 KB) | HTML

Message-passing iterative decoders for low-density parity-check (LDPC) block codes are known to be subject to decoding failures due to so-called pseudocodewords. These failures can cause the large signal-to-noise ratio (SNR) performance of message-passing iterative decoding to be worse than that predicted by the maximum-likelihood (ML) decoding union bound. In this paper, we address the pseudocode... View full abstract»

• ### On the Values of Kloosterman Sums

Publication Year: 2009, Page(s):2599 - 2601
Cited by:  Papers (4)
| | PDF (110 KB) | HTML

Given a prime p and a positive integer n, we show that the shifted Kloosterman sums SigmaxisinF p nPsi(x + alphaxpn-2)=SigmaxisinF* p nPsi(x+alphax-1)+1, alphaisinF*pn where Psi is a nontrivial additive character of a finite field Fpn of pn elements, do not vanish if alpha belon... View full abstract»

• ### Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel

Publication Year: 2009, Page(s):2602 - 2617
Cited by:  Papers (12)
| | PDF (380 KB) | HTML

This paper provides simple lower bounds on the number of iterations which is required for successful message-passing decoding of some important families of graph-based code ensembles (including low-density parity-check (LDPC) codes and variations of repeat-accumulate codes). The transmission of the code ensembles is assumed to take place over a binary erasure channel, and the bounds refer to the a... View full abstract»

• ### On Cyclic $q$ -ary Images in Concatenated Form

Publication Year: 2009, Page(s):2618 - 2621
Cited by:  Papers (1)
| | PDF (153 KB) | HTML

This paper shows that q-ary images of some cyclic codes can be put into concatenated form in the sense of Jensen (1985). This description utilizes an isomorphism between the GF(q)-algebras GF(q) [z] / (znm - 1) and GF (q )[x, y] / (xn - 1, ym - x). We also describe an element of the constacyclic outer code, which is of great help in determining one of its generator... View full abstract»

• ### Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs

Publication Year: 2009, Page(s):2622 - 2625
Cited by:  Papers (7)
| | PDF (109 KB) | HTML

The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect binary one-error-correcting code from its minimum distance graph is presented. Consequently, inequivalent such codes have nonisomorphic minimum distance graphs... View full abstract»

• ### Simplification of Packet-Symbol Decoding With Errors, Deletions, Misordering of Packets, and No Sequence Numbers

Publication Year: 2009, Page(s):2626 - 2639
Cited by:  Papers (2)
| | PDF (515 KB) | HTML

In this paper, a new method is described which builds on Mitzenmacher's idea of adding a different pseudorandom number to each packet to help decode packet-symbol low-density codes, with deletions, errors, and out-of-order reception, without sequence numbers. The new method has lower decoding complexity than the original method. The most basic form of the new method applies to any parity-check cod... View full abstract»

• ### Braided Block Codes

Publication Year: 2009, Page(s):2640 - 2658
Cited by:  Papers (29)  |  Patents (4)
| | PDF (1089 KB) | HTML

A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe me... View full abstract»

• ### Rank Modulation for Flash Memories

Publication Year: 2009, Page(s):2659 - 2673
Cited by:  Papers (139)  |  Patents (49)
| | PDF (401 KB) | HTML

We explore a novel data representation scheme for multilevel flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. The only allowed charge-placement mechanism is a ldquopush-to-the-toprdquo operation, which takes a single cell of the set and makes it the top-charged cell. The resulting scheme elimi... View full abstract»

• ### Upper Bound on Error Exponent of Regular LDPC Codes Transmitted Over the BEC

Publication Year: 2009, Page(s):2674 - 2681
Cited by:  Papers (2)
| | PDF (270 KB) | HTML

The error performance of the ensemble of typical low-definition parity-check (LDPC ) codes transmitted over the binary erasure channel (BEC) is analyzed. In the past, lower bounds on the error exponents were derived. In this paper, a probabilistic upper bound on this error exponent is derived. This bound holds with some confidence level. View full abstract»

• ### High-Rate, Multisymbol-Decodable STBCs From Clifford Algebras

Publication Year: 2009, Page(s):2682 - 2695
Cited by:  Papers (14)
| | PDF (523 KB) | HTML

It is well known that space-time block codes (STBCs) obtained from orthogonal designs (ODs) are single-symbol decodable (SSD) and from quasi-orthogonal designs (QODs) are double-symbol decodable (DSD). However, there are SSD codes that are not obtainable from ODs and DSD codes that are not obtainable from QODs. In this paper, a method of constructing g-symbol decodable ( g-SD) STBCs ... View full abstract»

• ### Algebraic Number Precoding for Space–Time Block Codes

Publication Year: 2009, Page(s):2696 - 2704
Cited by:  Papers (2)
| | PDF (647 KB) | HTML

We propose a space-time block coding framework based on linear precoding. The codes for P transmit antennas are formed by transmitting the information vector (with P independent information symbols) L times where each time it is rotated by a distinct precoding matrix. The framework generalizes conventional spatial multiplexing techniques and facilitates tradeoff between rate and diversity. We prop... View full abstract»

• ### A Class of Errorless Codes for Overloaded Synchronous Wireless and Optical CDMA Systems

Publication Year: 2009, Page(s):2705 - 2715
Cited by:  Papers (27)  |  Patents (1)
| | PDF (528 KB) | HTML

In this paper, we introduce a new class of codes for overloaded synchronous wireless and optical code-division multiple-access (CDMA) systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be reduced for a given number of users, which implies bandwidth reduction for downlink wireless systems. An upper bound for the maxi... 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