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 56

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

Publication Year: 2014, Page(s): C2
| PDF (141 KB)
• ### 2013 IEEE Information Theory Society Paper Award

Publication Year: 2014, Page(s):1 - 2
| PDF (636 KB) | HTML
• ### 2013 IEEE Communications Society and Information Theory Society Joint Paper Award

Publication Year: 2014, Page(s):3 - 4
| PDF (742 KB) | HTML
• ### Empirical Distribution of Good Channel Codes With Nonvanishing Error Probability

Publication Year: 2014, Page(s):5 - 21
Cited by:  Papers (9)
| | PDF (4593 KB) | HTML

This paper studies several properties of channel codes that approach the fundamental limits of a given (discrete or Gaussian) memoryless channel with a nonvanishing probability of error. The output distribution induced by an ϵ-capacity-achieving code is shown to be close in a strong sense to the capacity achieving output distribution. Relying on the concentration of measure (isoperimetry) p... View full abstract»

• ### On Marton's Inner Bound and Its Optimality for Classes of Product Broadcast Channels

Publication Year: 2014, Page(s):22 - 41
Cited by:  Papers (7)
| | PDF (8659 KB) | HTML

Marton's inner bound is the tightest known inner bound on the capacity region of the broadcast channel. It is not known, however, if this bound is tight in general. One approach to settle this key open problem in network information theory is to investigate the multiletter extension of Marton's bound, which is known to be tight in general. This approach has become feasible only recently through th... View full abstract»

• ### The Capacity Region of the Class of Three-Receiver Gaussian MIMO Multilevel Broadcast Channels With Two-Degraded Message Sets

Publication Year: 2014, Page(s):42 - 53
Cited by:  Papers (1)
| | PDF (3542 KB) | HTML

Nair and El Gamal established the capacity region of the three-receiver multilevel broadcast channel (MBC) with two-degraded message sets. For the three-receiver MBC with two-degraded message sets, the output at receiver 2 is a degraded version of the output at receiver 1. However, no order of degradedness is imposed on the output at receiver 3. The transmitter sends a common message to all three ... View full abstract»

• ### Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback

Publication Year: 2014, Page(s):54 - 71
Cited by:  Papers (11)
| | PDF (538 KB) | HTML

A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than ±1, the gap between the sum-rate that the scheme achieves and the full-cooperation bound vanishes as the signal-to-noise ratio tends to infinity. When the correlation coefficient is -1, the gains afforded by feedback are unbounded and the prelo... View full abstract»

• ### Analytical and Numerical Characterizations of Shannon Ordering for Discrete Memoryless Channels

Publication Year: 2014, Page(s):72 - 83
| | PDF (3180 KB) | HTML

This paper studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion between certain DMCs. Furthermore, under general conditions, channel equivalence defined through Shannon ordering is shown to be the same as permutation of input a... View full abstract»

• ### Symmetrical Multilevel Diversity Coding and Subset Entropy Inequalities

Publication Year: 2014, Page(s):84 - 103
Cited by:  Papers (11)
| | PDF (513 KB) | HTML

Symmetrical multilevel diversity coding (SMDC) is a classical model for coding over distributed storage. In this setting, a simple separate encoding strategy known as superposition coding was shown to be optimal in terms of achieving the minimum sum rate and the entire admissible rate region of the problem. The proofs utilized carefully constructed induction arguments, for which the classical subs... View full abstract»

• ### Sharp Inequalities for $f$ -Divergences

Publication Year: 2014, Page(s):104 - 121
Cited by:  Papers (9)
| | PDF (722 KB) | HTML

f-divergences are a general class of divergences between probability measures which include as special cases many commonly used divergences in probability, mathematical statistics, and information theory such as Kullback-Leibler divergence, chi-squared divergence, squared Hellinger distance, total variation distance, and so on. In this paper, we study the problem of maximizing or minimizing an f-d... View full abstract»

• ### Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices

Publication Year: 2014, Page(s):122 - 132
Cited by:  Papers (51)
| | PDF (341 KB) | HTML

This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key technical tool, which represents points in a polytope by convex combinations of sparse vectors. The technique is elementary while yielding sharp results. It is shown t... View full abstract»

• ### On the Fundamental Limits of Recovering Tree Sparse Vectors From Noisy Linear Measurements

Publication Year: 2014, Page(s):133 - 149
Cited by:  Papers (9)
| | PDF (562 KB) | HTML

Recent breakthrough results in compressive sensing (CS) have established that many high dimensional signals can be accurately recovered from a relatively small number of non-adaptive linear observations, provided that the signals possess a sparse representation in some basis. Subsequent efforts have shown that the performance of CS can be improved by exploiting additional structure in the location... View full abstract»

• ### Signal Estimation With Additive Error Metrics in Compressed Sensing

Publication Year: 2014, Page(s):150 - 158
Cited by:  Papers (6)
| | PDF (2194 KB) | HTML

Compressed sensing typically deals with the estimation of a system input from its noise-corrupted linear measurements, where the number of measurements is smaller than the number of input components. The performance of the estimation process is usually quantified by some standard error metric such as squared error or support set error. In this correspondence, we consider a noisy compressed sensing... View full abstract»

• ### Discretized Gabor Frames of Totally Positive Functions

Publication Year: 2014, Page(s):159 - 169
Cited by:  Papers (7)
| | PDF (407 KB) | HTML

In this paper, a large class of universal windows for Gabor frames (Weyl-Heisenberg frames) is constructed. These windows have the fundamental property that every overcritical rectangular lattice generates a Gabor frame. Likewise, every undercritical rectangular lattice generates a Riesz sequence. View full abstract»

• ### Kirkman Equiangular Tight Frames and Codes

Publication Year: 2014, Page(s):170 - 181
Cited by:  Papers (12)
| | PDF (2988 KB) | HTML

An equiangular tight frame (ETF) is a set of unit vectors in a Euclidean space whose coherence is as small as possible, equaling the Welch bound. Also known as Welch-bound-equality sequences, such frames arise in various applications, such as waveform design and compressed sensing. At the moment, there are only two known flexible methods for constructing ETFs: harmonic ETFs are formed by carefully... View full abstract»

• ### Burst List Decoding of Interleaved Reed–Solomon Codes

Publication Year: 2014, Page(s):182 - 190
Cited by:  Papers (1)
| | PDF (518 KB) | HTML

It is shown that interleaved Reed-Solomon codes can be list-decoded for burst errors while attaining the generalized Reiger bound for list decoding. A respective decoding algorithm is presented that is (significantly) more efficient than a burst list decoder for a noninterleaved Reed-Solomon code with comparable parameters. Finally, it is shown through counterexamples that unlike the special case ... View full abstract»

• ### On Decoding Irregular Tanner Codes With Local-Optimality Guarantees

Publication Year: 2014, Page(s):191 - 211
Cited by:  Papers (2)
| | PDF (5634 KB) | HTML

We consider decoding of binary linear Tanner codes using message-passing iterative decoding and linear-programming (LP) decoding in memoryless binary-input output-symmetric (MBIOS) channels. We present new certificates that are based on a combinatorial characterization for the local optimality of a codeword in irregular Tanner codes with respect to any MBIOS channel. This characterization is a gen... View full abstract»

• ### Optimal Locally Repairable and Secure Codes for Distributed Storage Systems

Publication Year: 2014, Page(s):212 - 236
Cited by:  Papers (65)
| | PDF (1118 KB) | HTML

This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSSs). Security and local-repairability are both important as features of an efficient storage system, and this paper aims to understand the trade-offs between resilience, security, and local-repairability in these systems. In particular, this paper first investigates securit... View full abstract»

• ### A Contention-Free Parallel Access by Butterfly Networks for Turbo Interleavers

Publication Year: 2014, Page(s):237 - 251
Cited by:  Papers (7)
| | PDF (1189 KB) | HTML

A theoretical foundation for any turbo interleaver to be a contention-free interleaver to access data in parallel by a butterfly network is presented. A contention-free parallel access of multiple memories in parallel plays a crucial role for implementing high speed turbo decoders for high data rate applications. The presented theoretical analysis shows that a butterfly network has a sufficiently ... View full abstract»

• ### $G$ -Equivalence in Group Algebras and Minimal Abelian Codes

Publication Year: 2014, Page(s):252 - 260
Cited by:  Papers (2)
| | PDF (2994 KB) | HTML

Let G be a finite Abelian group and BBF a field such that char(BBF ) does not divide |G|. Denote by BBF G the group algebra of G over BBF. A (semisimple) Abelian code is an ideal of BBF G. Two codes ℑ1 and ℑ2 of BBF G are G-equivalent if there exists an automorphism ψ of G whose linear extension to BBF G maps ℑ1 onto ℑ2... View full abstract»

• ### On the Error Detection Capability of One Check Digit

Publication Year: 2014, Page(s):261 - 270
| | PDF (289 KB) | HTML

In this paper, we study a check digit system which is based on the use of elementary abelian p-groups of order pk. This paper is inspired by a recently introduced check digit system for hexadecimal numbers. By interpreting its check equation in terminology of matrix algebra, we generalize the idea to build systems over a group of order pk, while keeping the ability to detect ... View full abstract»

• ### Gray Codes and Enumerative Coding for Vector Spaces

Publication Year: 2014, Page(s):271 - 281
Cited by:  Papers (2)
| | PDF (2769 KB) | HTML

Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes are given for all parameters. As for the projective-space graph, two constructions for specific parameters are provided, as well some nonexistence results. Fur... View full abstract»

• ### On the Weight Hierarchy of Codes Coming From Semigroups With Two Generators

Publication Year: 2014, Page(s):282 - 295
Cited by:  Papers (5)
| | PDF (5072 KB) | HTML

The weight hierarchy of one-point algebraic geometry codes can be estimated by means of the generalized order bounds, which are described in terms of a certain Weierstrass semigroup. The asymptotical behavior of such bounds for r ≥ 2 differs from that of the classical Feng-Rao distance (r=1) by the so-called Feng-Rao numbers. This paper is addressed to compute the Feng-Rao numbers for numer... View full abstract»

• ### Weight Distributions of Two Classes of Cyclic Codes With Respect to Two Distinct Order Elements

Publication Year: 2014, Page(s):296 - 303
Cited by:  Papers (14)
| | PDF (647 KB) | HTML

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Cyclic codes have been studied for many years, but their weight distributions are known only for a few cases. In this paper, let Fr be an extension of a finite field Fq and r = qm, we determine... 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