# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 38

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

Publication Year: 2007, Page(s): C2
| PDF (38 KB)
• ### The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space–Time Block Codes

Publication Year: 2007, Page(s):2677 - 2684
Cited by:  Papers (22)
| | PDF (185 KB) | HTML

The growing demand for efficient wireless transmissions over fading channels motivated the development of space-time block codes. Space-time block codes built from generalized complex orthogonal designs are particularly attractive because the orthogonality permits a simple decoupled maximum-likelihood decoding algorithm while achieving full transmit diversity. The two main research problems for th... View full abstract»

• ### The PBD-Closure of Constant-Composition Codes

Publication Year: 2007, Page(s):2685 - 2692
Cited by:  Papers (21)
| | PDF (265 KB) | HTML

We show an interesting pairwise balanced design (PBD)-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the sizes... View full abstract»

• ### Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels

Publication Year: 2007, Page(s):2693 - 2714
Cited by:  Papers (40)  |  Patents (1)
| | PDF (549 KB) | HTML

This paper considers the capacity of binary deletion channels, where bits are deleted independently with probability d. It improves significantly upon the best previous framework used to obtain provable lower bounds on this capacity by utilizing a stronger definition of a typical output from the channel. The new results give the best known provable bounds on the capacity for all values of d. Moreo... View full abstract»

• ### Space–Time Constellation Design for Partial CSI at the Receiver

Publication Year: 2007, Page(s):2715 - 2731
Cited by:  Papers (13)
| | PDF (449 KB) | HTML

The design of signal constellations for a communication system using multiple transmitter antennas over a Rayleigh-fading channel is considered under the assumption that no channel state information (CSI) is available at the transmitter and the receiver has acquired a CSI estimate with known error covariance. This setup encompasses the well-studied scenarios of perfect and no channel knowledge at ... View full abstract»

• ### On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users

Publication Year: 2007, Page(s):2732 - 2742
Cited by:  Papers (22)
| | PDF (300 KB) | HTML

New improved upper and lower bounds on the maximum size of a symmetric or arbitrary conflict-avoiding code of length n = 4 m for three active users are proved. Furthermore, direct constructions for optimal conflict-avoiding codes of length n = 4 m and m equiv 2 (mod 4) for three active users are provided. View full abstract»

• ### Diversity–Multiplexing Tradeoff in MIMO Channels With Partial CSIT

Publication Year: 2007, Page(s):2743 - 2759
Cited by:  Papers (83)
| | PDF (817 KB) | HTML

The diversity-multiplexing (D-M) tradeoff in a multi antenna channel with optimized resolution-constrained channel state feedback is characterized. The concept ofminimum guaranteed multiplexing gainin the forward link is introduced and shown to significantly influence the optimal D-M tradeoff. It is demonstrated that power control based on the feedback is instrumental in achieving the D-M t... View full abstract»

• ### Bounds for Binary Codes With Narrow Distance Distributions

Publication Year: 2007, Page(s):2760 - 2768
Cited by:  Papers (2)
| | PDF (216 KB) | HTML

New lower bounds are presented on the second moment of the distance distribution of binary codes, in terms of the first moment of the distribution. These bounds are used to obtain upper bounds on the size of codes whose maximum distance is close to their minimum distance. It is then demonstrated how such bounds can be applied to bound from below the smallest attainable ratio between the maximum di... View full abstract»

• ### Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing

Publication Year: 2007, Page(s):2769 - 2790
Cited by:  Papers (3)
| | PDF (652 KB) | HTML

We introduce the fixed-rate bit stuff (FRB) algorithm for efficiently encoding and decoding maximum-runlength-limited (MRL) sequences. Our approach is based on a simple, variable-rate technique called <i>bit stuffing</i>. Bit stuffing produces near-capacity achieving codes for a wide range of constraints, but encoding is variable-rate, which is unacceptable in most applications. In thi... View full abstract»

• ### Ternary Schedules for Energy-Limited Sensor Networks

Publication Year: 2007, Page(s):2791 - 2798
Cited by:  Papers (6)
| | PDF (275 KB) | HTML

Medium access control for multihop wireless sensor networks (WSNs) must be energy efficient because the battery-operated nodes are not practical to recharge. We give constructions for ternary schedules in which each node is in one of three states: transmitting, receiving, or asleep. For each hop (v<sub>i</sub>, v<sub>j</sub>), communication is effective only when v<sub&g... View full abstract»

• ### Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation

Publication Year: 2007, Page(s):2799 - 2814
Cited by:  Papers (191)
| | PDF (575 KB) | HTML

The transmission capacity (TC) of a wireless ad hoc network is defined as the maximum spatial intensity of successful transmissions such that the outage probability does not exceed some specified threshold. This work studies the improvement in TC obtainable with successive interference cancellation (SIC), an important receiver technique that has been shown to achieve the capacity of several... View full abstract»

• ### A Binary Communication Channel With Memory Based on a Finite Queue

Publication Year: 2007, Page(s):2815 - 2840
Cited by:  Papers (19)
| | PDF (883 KB) | HTML

A model for a binary additive noise communication channel with memory is introduced. The channel noise process, which is generated according to a ball sampling mechanism involving a queue of finite length M, is a stationary ergodic Mth-order Markov source. The channel properties are analyzed and several of its statistical and information-theoretical quantities (e.g., block transition distribution,... View full abstract»

• ### The Maximum Entropy Principle in the Absence of a Time-Arrow: Fractional-Pole Models

Publication Year: 2007, Page(s):2841 - 2851
Cited by:  Papers (3)
| | PDF (521 KB) | HTML

The maximum entropy (ME) principle, as it is often invoked in the context of time-series analysis, suggests the selection of a power spectrum which is consistent with autocorrelation data and corresponds to a random process least predictable from past observations. We introduce and compare a class of spectra with the property that the underlying random process is least predictable at any given poi... View full abstract»

• ### Performance Measures for Neyman–Pearson Classification

Publication Year: 2007, Page(s):2852 - 2863
Cited by:  Papers (27)  |  Patents (1)
| | PDF (295 KB) | HTML

In the Neyman-Pearson (NP) classification paradigm, the goal is to learn a classifier from labeled training data such that the probability of a false negative is minimized while the probability of a false positive is below a user-specified level alpha isin (0,1). This work addresses the question of how to evaluate and compare classifiers in the NP setting. Simply reporting false positives and fals... View full abstract»

• ### There Are No Further Counterexamples to S. Piccard's Theorem

Publication Year: 2007, Page(s):2864 - 2867
Cited by:  Papers (2)
| | PDF (168 KB) | HTML

In 1977, G. S. Bloom, in the J. Combinatorial Theory, showed that Sophie Piccard's ldquotheoremrdquo had counterexamples for six-mark rulers. Subsequent research into finding additional counterexamples has focused on a variety of computer algorithms, such as searching the space of rulers with relatively few marks in an attempt to find another counterexample. Recent analytic effort has made use of ... View full abstract»

• ### On the Distortion SNR Exponent of Hybrid Digital–Analog Space–Time Coding

Publication Year: 2007, Page(s):2867 - 2878
Cited by:  Papers (61)
| | PDF (849 KB) | HTML

We consider the transmission of a real independent and identically distributed (i.i.d.) "analog" source over a quasi-static M-input N-output multiple-input multiple-output (MIMO) block-fading channel. The relevant performance criterion is end-to-end average quadratic distortion D versus channel signal-to-noise ratio (SNR), for given spectral efficiency eta, defined as the ratio of the source bandw... View full abstract»

• ### A Note on the Optimality of Variant-I Permutation Modulation Codes

Publication Year: 2007, Page(s):2878 - 2879
Cited by:  Papers (1)
| | PDF (96 KB) | HTML

In this correspondence, the optimality of variant-I permutation codes initially proposed by Slepian [see proc. IEEE, vol. 53, no. 3, p. 228-236, Mar. 1965] is shown in a simple way. View full abstract»

• ### Lower Bounds for Binary Codes of Covering Radius One

Publication Year: 2007, Page(s):2880 - 2881
| | PDF (102 KB) | HTML

Let K(n, l) denote the minimal cardinality of a binary code of length n and covering radius one. Blass and Litsyn proved a lower bound K(n, l) for in the case n equiv 5 (mod6). We give a simplification of the proof, which yields a slightly better result. View full abstract»

• ### Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm

Publication Year: 2007, Page(s):2881 - 2885
Cited by:  Papers (1)
| | PDF (174 KB) | HTML

By introducing a few simplifying assumptions we derive a simple condition for successful decoding using the Koetter-Vardy algorithm for soft-decision decoding of Reed-Solomon codes. We show that the algorithm has a significant advantage over hard decision decoding when the code rate is low, when two or more sets of received symbols have substantially different reliabilities, or when the number of ... View full abstract»

• ### Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than$12$

Publication Year: 2007, Page(s):2885 - 2891
Cited by:  Papers (48)  |  Patents (6)
| | PDF (369 KB) | HTML

A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph code with circulant permutation matrices (or circulants). In this correspondence, we find all the subgraph patterns of protographs of QC LDPC codes having inevitable cycles of length 2i, i = 6, 7, 8, 9,10, i.e., the cycles that always exist regardless of the shift values of circulants. It is also derived that ... View full abstract»

• ### An Analysis of Blocking Switches Using Error Control Codes

Publication Year: 2007, Page(s):2892 - 2897
| | PDF (272 KB) | HTML

We study the relationship between the degree of blocking and the amount of resource speedup necessary for blocking switches to possess the capabilities of nonblocking switches. We construct an analogy between switch configurations and the codewords of certain error control codes for which we use space covering ideas to derive relations between speedup and number of switch configurations. To derive... View full abstract»

• ### Some Designs of Full Rate Space–Time Codes With Nonvanishing Determinant

Publication Year: 2007, Page(s):2898 - 2908
Cited by:  Papers (11)
| | PDF (472 KB) | HTML

In this correspondence, we first present a transformation technique to improve the normalized diversity product for a full rate algebraic space-time block code (STBC) by balancing the signal mean powers at different transmit antennas. After rewriting a cyclic division algebra structure into a multilayer structure for a full rate code, we show that the normalized diversity product of the transforme... View full abstract»

• ### A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables

Publication Year: 2007, Page(s):2908 - 2910
Cited by:  Papers (27)
| | PDF (137 KB) | HTML

In this note, it is proved that for each odd positive integer n there are exactly two n-variable symmetric Boolean functions with maximum algebraic immunity. View full abstract»

• ### On the Capacity of Time-Varying Channels With Periodic Feedback

Publication Year: 2007, Page(s):2910 - 2915
Cited by:  Papers (6)
| | PDF (458 KB) | HTML

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel-state information (CSI) is perfectly known at the receiver and is fed back to the transmitter at the regular time intervals. The system capacity is investigated in two cases: 1) finite-state Markov channel, and 2) additive white Gaussian noise channel with time-correlated fa... 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