# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 51

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

Publication Year: 2010, Page(s): C2
| PDF (41 KB)
• ### Broadcasting Correlated Gaussians

Publication Year: 2010, Page(s):3057 - 3068
Cited by:  Papers (24)
| | PDF (288 KB) | HTML

We study the transmission of a memoryless bivariate Gaussian source over an average-power-constrained one-to-two Gaussian broadcast channel. The transmitter observes the source and describes it to the two receivers by means of an average-power-constrained signal. Each receiver observes the transmitted signal corrupted by a different additive white Gaussian noise and wishes to estimate the source c... View full abstract»

• ### Generalizing Capacity: New Definitions and Capacity Theorems for Composite Channels

Publication Year: 2010, Page(s):3069 - 3087
Cited by:  Papers (29)
| | PDF (667 KB) | HTML

We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with a distribution characterizing the probability that each channel is in operation. The Shannon capacity of a channel is the highest rate asymptotically achievable with arbitrarily small error probability. Under this defin... View full abstract»

• ### Secure Transmission With Multiple Antennas I: The MISOME Wiretap Channel

Publication Year: 2010, Page(s):3088 - 3104
Cited by:  Papers (566)
| | PDF (480 KB) | HTML

The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple antennas, the intended receiver has a single antenna, and the channel matrices are fixed and known to all the terminals, and show that a beamforming strategy is... View full abstract»

• ### Rateless Codes for AVC Models

Publication Year: 2010, Page(s):3105 - 3114
Cited by:  Papers (10)
| | PDF (264 KB) | HTML

The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This paper defines a variable-length perspective on this problem, for which achievable rates are shown that depend on the realized actions of the adversary. Specifically... View full abstract»

• ### The Multisession Multilayer Broadcast Approach for Two Cooperating Receivers—How Many Sessions Are Required?

Publication Year: 2010, Page(s):3115 - 3138
Cited by:  Papers (2)
| | PDF (855 KB) | HTML

We consider the problem of transmission of a common message from a single source to two cooperating destination users, exhibiting different signal-to-noise ratios (SNR). The cooperation is performed over a noiseless link with a total capacity limitCcoop, which the users may utilize for conversation. In order to maximize the achievable throughput, it is suggested to employ a multi... View full abstract»

• ### Word-Valued Sources: An Ergodic Theorem, an AEP, and the Conservation of Entropy

Publication Year: 2010, Page(s):3139 - 3148
Cited by:  Papers (1)
| | PDF (256 KB) | HTML

A word-valued source Y = Y<sub>1</sub>,Y<sub>2</sub>,<i>...</i> is discrete random process that is formed by sequentially encoding the symbols of a random process X = X<sub>1</sub>,X<sub>2</sub><i>,...</i> with codewords from a codebook <i>C</i>. These processes appear frequently in information theory (in particula... View full abstract»

• ### Squeezing the Arimoto–Blahut Algorithm for Faster Convergence

Publication Year: 2010, Page(s):3149 - 3157
Cited by:  Papers (7)
| | PDF (216 KB) | HTML

The Arimoto-Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited. A so-called “squeezing” strategy is used to design algorithms that preserve its simplicity and monotonic convergence properties, but have provably better rates of convergence. View full abstract»

• ### Codes in Permutations and Error Correction for Rank Modulation

Publication Year: 2010, Page(s):3158 - 3165
Cited by:  Papers (79)  |  Patents (6)
| | PDF (188 KB) | HTML

Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representing them as subsets of the set of permutations ofnelements equipped with the Kendall tau distance. We derive several lower and upper bounds on the size of codes. These bounds enable us to establish the exact scalin... View full abstract»

• ### Affine Grassmann Codes

Publication Year: 2010, Page(s):3166 - 3176
Cited by:  Papers (6)
| | PDF (287 KB) | HTML

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum distance of any affine Grassmann code. Moreover, we show that affine Grassmann codes have a large automorphism group and determine the number of minimum weight codewo... View full abstract»

• ### Isometries and Construction of Permutation Arrays

Publication Year: 2010, Page(s):3177 - 3179
Cited by:  Papers (3)
| | PDF (120 KB) | HTML

An <i>(n,d)</i>-permutation code is a subset <i>C</i> of <i>Sym(n)</i> such that the Hamming distance <i>d_H</i> between any two distinct elements of <i>C</i> is at least equal to <i>d</i> . In this paper, we use the characterization of the isometry group of the metric space <i>(Sym(n),d_H)</i> in order to develop ... View full abstract»

• ### Duality for Poset Codes

Publication Year: 2010, Page(s):3180 - 3186
Cited by:  Papers (10)
| | PDF (185 KB) | HTML

In this paper, we extend Wei's Duality Theorem, relating the generalized Hamming weight hierarchy of a code to the hierarchy of the dual code, to the scope of codes with poset metrics. As a consequence of this duality theorem, we prove some results concerning discrepancy of codes and chain condition for generalized weights. View full abstract»

• ### On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory

Publication Year: 2010, Page(s):3187 - 3195
Cited by:  Papers (156)
| | PDF (472 KB) | HTML

The <i>index coding</i> problem has recently attracted a significant attention from the research community due to its theoretical significance and applications in wireless ad hoc networks. An instance of the index coding problem includes a sender that holds a set of information messages <i>X={x</i><sub>1</sub><i>,...,x</i><sub>k</sub><... View full abstract»

• ### A Combinatorial Approach to X-Tolerant Compaction Circuits

Publication Year: 2010, Page(s):3196 - 3206
Cited by:  Papers (6)
| | PDF (260 KB) | HTML

Test response compaction for integrated circuits (ICs) with scan-based design-for-testability (DFT) support in the presence of unknown logic values (Xs) is investigated from a combinatorial viewpoint. The theoretical foundations of X-codes, employed in an X-tolerant compaction technique called X-compact, are examined. Through the formulation of a combinatorial model of X-compact, novel design tech... View full abstract»

• ### Constant-Rank Codes and Their Connection to Constant-Dimension Codes

Publication Year: 2010, Page(s):3207 - 3216
Cited by:  Papers (30)
| | PDF (276 KB) | HTML

Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum distance is and how to construct the optimal constant-dimension code (or codes) that achieves the maximal cardinality both remain open research problems. In thi... View full abstract»

• ### Optimal Single Deletion Correcting Code of Length Four Over an Alphabet of Even Size

Publication Year: 2010, Page(s):3217 - 3220
| | PDF (151 KB) | HTML

We improve Levenshtein's upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we construct an optimal perfect code that is capable of correcting single deletions for the same parameters. View full abstract»

• ### Multigroup ML Decodable Collocated and Distributed Space-Time Block Codes

Publication Year: 2010, Page(s):3221 - 3247
Cited by:  Papers (50)
| | PDF (624 KB) | HTML

In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is considered and the problem of constructing space-time block codes (STBCs) which optimally tradeoff rate and ML decoding complexity is posed. Recently, sufficient conditions for multigroup ML decodability have been provided in t... View full abstract»

• ### On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes

Publication Year: 2010, Page(s):3248 - 3264
Cited by:  Papers (31)
| | PDF (1210 KB) | HTML

It is shown that dominant trapping sets of regular low-density parity-check (LDPC) codes, so-called absorption sets, undergo a two-phased dynamic behavior in the iterative message-passing decoding algorithm. Using a linear dynamic model for the iteration behavior of these sets, it is shown that they undergo an initial geometric growth phase which stabilizes in a final bit-flipping behavior where t... View full abstract»

• ### A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes

Publication Year: 2010, Page(s):3265 - 3276
Cited by:  Papers (20)
| | PDF (278 KB) | HTML

Conflict-avoiding codes are used in the multiple-access collision channel without feedback. The number of codewords in a conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, a new upper bound on the size of constant-weight conflict-avoiding codes is proved. This upper bound is general in the sense that it is applicable to all code lengths and ... View full abstract»

• ### A Separation Algorithm for Improved LP-Decoding of Linear Block Codes

Publication Year: 2010, Page(s):3277 - 3289
Cited by:  Papers (23)
| | PDF (423 KB) | HTML

Maximum likelihood (ML) decoding is the optimal decoding algorithm for arbitrary linear block codes and can be written as an integer programming (IP) problem. Feldman relaxed this IP problem and presented linear programming (LP) based decoding. In this paper, we propose a new separation algorithm to improve the error-correcting performance of LP decoding for binary linear block codes. We use an IP... View full abstract»

• ### On the Efficiency of Shortened Cyclic Single-Burst-Correcting Codes

Publication Year: 2010, Page(s):3290 - 3296
Cited by:  Papers (6)
| | PDF (305 KB) | HTML

Shortened cyclic codes that are capable of correcting up to a single burst of errors are considered. The efficiency of such codes has been analized by how well they approximate the Reiger bound, i.e., by the burst-correcting efficiency of the code. Although the efficiency is still an important parameter, it is shown that this one is not necessarily the most important consideration when choosing a ... View full abstract»

• ### Generalized Degrees of Freedom of the Symmetric Gaussian$K$User Interference Channel

Publication Year: 2010, Page(s):3297 - 3303
Cited by:  Papers (96)  |  Patents (2)
| | PDF (464 KB) | HTML

We characterize the generalized degrees of freedom of the K user symmetric Gaussian interference channel where all desired links have the same signal-to-noise ratio (SNR) and all undesired links carrying interference have the same interference-to-noise ratio, INR = SNRα. We find that the number of generalized degrees of freedom per user, d(α), does not depend on the number of users, so ... View full abstract»

• ### On the DMT-Optimality of Nondynamic DF Relaying in Asymmetric Nakagami Fading Channels

Publication Year: 2010, Page(s):3304 - 3309
Cited by:  Papers (4)
| | PDF (211 KB) | HTML

The optimality of nondynamic DF relaying over a general three-node Nakagami fading channel in terms of the diversity-multiplexing tradeoff (DMT) is established. In particular, when the fading of the relay-source link is less severe than that of the relay-destination link, both orthogonal and nonorthogonal DF protocols are shown to be DMT-optimal over certain ranges of the multiplexing gains. It is... View full abstract»

• ### Power-Controlled Feedback and Training for Two-Way MIMO Channels

Publication Year: 2010, Page(s):3310 - 3331
Cited by:  Papers (11)
| | PDF (776 KB) | HTML

Most communication systems use some form of feedback, often related to channel state information. The common models used in analyses either assume perfect channel state information at the receiver and/or noiseless state feedback links. However, in practical systems, neither is the channel estimate known perfectly at the receiver and nor is the feedback link perfect. In this paper, we study the ach... 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