# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 50

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

Publication Year: 2014, Page(s): C2
| PDF (142 KB)
• ### A Theory of Network Equivalence – Part II: Multiterminal Channels

Publication Year: 2014, Page(s):3709 - 3732
Cited by:  Papers (11)
| | PDF (2348 KB) | HTML

A technique for bounding the capacities of networks of independent channels is introduced. Parts I and II treat point-to-point and multiterminal channels, respectively. Bounds are derived using a new tool called a bounding model. Channel 1 is an upper (lower) bounding model for channel 2 if replacing channel 2 by channel 1 in any network yields a new network whose capacity region is a superset (su... View full abstract»

• ### Universal Communication—Part II: Channels With Memory

Publication Year: 2014, Page(s):3733 - 3747
| | PDF (895 KB) | HTML

Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about the future. The existence of reliable feedback and common randomness is assumed. In a previous paper, it was shown that the Shannon capacity cannot be attained... View full abstract»

• ### On Marton’s Inner Bound for the General Broadcast Channel

Publication Year: 2014, Page(s):3748 - 3762
| | PDF (438 KB) | HTML

We establish several new results on Marton's inner bound on the capacity region of the general broadcast channel. Inspired by the fact that Marton's coding scheme without superposition coding is optimal in the Gaussian case, we consider the class of binary input degraded broadcast channels with no common message that have the same property. We characterize this class. We also establish new propert... View full abstract»

• ### Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels

Publication Year: 2014, Page(s):3763 - 3772
Cited by:  Papers (2)
| | PDF (473 KB) | HTML

This paper studies the capacity of a class of discrete memoryless interference channels (DMICs), where interference is defined analogous to that of a Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class of channels is determined. As with the Gaussian case, the sum-rate capacity is achieved by letting the transceiver pair subject to interference commun... View full abstract»

• ### The Entropy Power Inequality and Mrs. Gerber's Lemma for Groups of Order${2^{n}}$

Publication Year: 2014, Page(s):3773 - 3786
Cited by:  Papers (9)
| | PDF (554 KB) | HTML

Shannon's entropy power inequality can be viewed as characterizing the minimum differential entropy achievable by the sum of two independent random variables with fixed differential entropies. The entropy power inequality has played a key role in resolving a number of problems in information theory. It is therefore interesting to examine the existence of a similar inequality for discrete random va... View full abstract»

• ### A New Entropy Power Inequality for Integer-Valued Random Variables

Publication Year: 2014, Page(s):3787 - 3796
Cited by:  Papers (9)
| | PDF (402 KB) | HTML

The entropy power inequality (EPI) yields lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have been obtained for special families of distributions with the differential entropy replaced by the discrete entropy, but no universal inequality is known (beyond triv... View full abstract»

• ### Rényi Divergence and Kullback-Leibler Divergence

Publication Year: 2014, Page(s):3797 - 3820
Cited by:  Papers (141)
| | PDF (2624 KB) | HTML

Rényi divergence is related to Rényi entropy much like Kullback-Leibler divergence is related to Shannon's entropy, and comes up in many settings. It was introduced by Rényi as a measure of information that satisfies almost the same axioms as Kullback-Leibler divergence, and depends on a parameter that is called its order. In particular, the Rényi divergence of order 1 equals the Kullback-Leibler ... View full abstract»

• ### Finite p-Groups, Entropy Vectors, and the Ingleton Inequality for Nilpotent Groups

Publication Year: 2014, Page(s):3821 - 3824
Cited by:  Papers (3)
| | PDF (229 KB) | HTML

In this paper, we study the capacity/entropy region of finite, directed, acyclic, multiple-sources, and multiple-sinks network by means of group theory and entropy vectors coming from groups. There is a one-to-one correspondence between the entropy vector of a collection of n random variables and a certain group-characterizable vector obtained from a finite group and n of its subgroups. We are loo... View full abstract»

• ### The Zero-Undetected-Error Capacity Approaches the Sperner Capacity

Publication Year: 2014, Page(s):3825 - 3833
Cited by:  Papers (4)
| | PDF (287 KB) | HTML

Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is lower bounded by the Sperner capacity of the channel graph, and they conjectured equality. Here, we derive an upper bound that proves the conjecture. View full abstract»

• ### Upper and Lower Bounds to the Information Rate Transferred Through First-Order Markov Channels With Free-Running Continuous State

Publication Year: 2014, Page(s):3834 - 3844
Cited by:  Papers (17)
| | PDF (688 KB) | HTML

Starting from the definition of mutual information, one promptly realizes that the probabilities inferred by Bayesian tracking can be used to compute the Shannon information between the state and the measurement of a dynamic system. In the Gaussian and linear case, the information rate can be evaluated from the probabilities computed by the Kalman filter. When the probability distributions inferre... View full abstract»

• ### Accurate Lower Bounds on 2-D Constraint Capacities From Corner Transfer Matrices

Publication Year: 2014, Page(s):3845 - 3858
Cited by:  Papers (1)
| | PDF (1682 KB) | HTML

We analyse the capacity of several 2-D constraint families-the exclusion, coloring, parity, and charge model families. Using Baxter's corner transfer matrix formalism combined with the corner transfer matrix renormalization group method of Nishino and Okunishi, we calculate very tight lower bounds and estimates on the growth rates of these models. Our results strongly improve previous known lower ... View full abstract»

• ### An Improvement of the Gilbert–Varshamov Bound Over Nonprime Fields

Publication Year: 2014, Page(s):3859 - 3861
Cited by:  Papers (1)
| | PDF (140 KB) | HTML

The Gilbert-Varshamov bound guarantees the existence of families of codes over the finite field Fwith good asymptotic parameters. We show that this bound can be improved for all nonprime fields Fwith ℓ ≥ 49 , except possibly ℓ = 125. We observe that the same improvement even holds within the class of transitive codes and within the class of self-orthogonal codes. View full abstract»

• ### An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes

Publication Year: 2014, Page(s):3862 - 3870
Cited by:  Papers (8)
| | PDF (624 KB) | HTML

We consider deletion correcting codes over a q-ary alphabet. It is well known that any code capable of correcting s deletions can also correct any combination of s total insertions and deletions. To obtain asymptotic upper bounds on code size, we apply a packing argument to channels that perform different mixtures of insertions and deletions. Even though the set of codes is identical for all of th... View full abstract»

• ### Torsion Limits and Riemann-Roch Systems for Function Fields and Applications

Publication Year: 2014, Page(s):3871 - 3888
Cited by:  Papers (7)
| | PDF (553 KB) | HTML

The Ihara limit (or constant) A(q) has been a central problem of study in the asymptotic theory of global function fields (or equivalently, algebraic curves over finite fields). It addresses global function fields with many rational points and, so far, most applications of this theory do not require additional properties. Motivated by recent applications, we require global function fields with the... View full abstract»

• ### Erasure List-Decodable Codes From Random and Algebraic Geometry Codes

Publication Year: 2014, Page(s):3889 - 3894
Cited by:  Papers (1)
| | PDF (183 KB) | HTML

Erasure list decoding was introduced to correct a larger number of erasures by outputting a list of possible candidates. In this paper, we consider both random linear codes and algebraic geometry codes for list decoding from erasures. The contributions of this paper are twofold. First, for arbitrary 0 <; R <; 1 and ϵ > 0 (R and ϵ are independent), we show that with high probability a q-ar... View full abstract»

• ### Hamming Weights of the Duals of Cyclic Codes With Two Zeros

Publication Year: 2014, Page(s):3895 - 3902
Cited by:  Papers (43)
| | PDF (982 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. In this paper, let Fr be a finite field with r = qm. Suppose that g1, g2 ∈ F*rare not conjugates over Fq, ord(g1) = n1, ord(g2) = n2, d = gcd(n1, n2), and n = n1n2/d. Let Fq(g1) = Fq... View full abstract»

• ### On the Weight Distribution of Cyclic Codes With Niho Exponents

Publication Year: 2014, Page(s):3903 - 3912
Cited by:  Papers (9)
| | PDF (871 KB) | HTML

Recently, there has been intensive research on the weight distributions of cyclic codes. In this paper, we compute the weight distributions of three classes of cyclic codes with Niho exponents. More specifically, we obtain two classes of binary three-weight and four-weight cyclic codes and a class of nonbinary four-weight cyclic codes. The weight distributions follow from the determination of valu... View full abstract»

• ### Non-Binary Protograph-Based LDPC Codes: Enumerators, Analysis, and Designs

Publication Year: 2014, Page(s):3913 - 3941
Cited by:  Papers (43)  |  Patents (1)
| | PDF (5013 KB) | HTML

This paper provides a comprehensive analysis of nonbinary low-density parity check (LDPC) codes built out of protographs. We consider both random and constrained edge-weight labeling, and refer to the former as the unconstrained nonbinary protograph-based LDPC codes (U-NBPB codes) and to the latter as the constrained nonbinary protograph-based LDPC codes (C-NBPB codes). Equipped with combinatorial... View full abstract»

• ### Short Q-Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation

Publication Year: 2014, Page(s):3942 - 3958
Cited by:  Papers (12)
| | PDF (1866 KB) | HTML

To the body of works on rewrite codes for constrained memories, we add a comprehensive study in a direction that is especially relevant to practical storage. The subject of this paper is codes for the q-ary extension of the write-once memories model, with input sizes that are fixed throughout the write sequence. Seven code constructions are given with guarantees on the number of writes they can su... View full abstract»

• ### The Complexity of Approximating a Bethe Equilibrium

Publication Year: 2014, Page(s):3959 - 3969
Cited by:  Papers (3)
| | PDF (513 KB) | HTML

This paper resolves a common complexity issue in the Bethe approximation of statistical physics and the belief propagation (BP) algorithm of artificial intelligence. The Bethe approximation and the BP algorithm are heuristic methods for estimating the partition function and marginal probabilities in graphical models, respectively. The computational complexity of the Bethe approximation is decided ... View full abstract»

• ### Sparse Recovery With Unknown Variance: A LASSO-Type Approach

Publication Year: 2014, Page(s):3970 - 3988
Cited by:  Papers (8)
| | PDF (905 KB) | HTML

We address the issue of estimating the regression vector β in the generic s-sparse linear model y = Xβ + z, with β ∈ ℝp, y ∈ ℝn, z ~ )V (0, σ2I), and p > n when the variance σ2 is unknown. We study two least absolute shrinkage and selection operator (LASSO)-type methods that jointly estimate β and the variance. These estimators are minimizers of the l1 penalized... View full abstract»

• ### Sparse Approximation and Recovery by Greedy Algorithms

Publication Year: 2014, Page(s):3989 - 4000
Cited by:  Papers (7)
| | PDF (282 KB) | HTML

We study sparse approximation by greedy algorithms. Our contribution is twofold. First, we prove exact recovery with high probability of random K-sparse signals within ΓK(1+ε)l iterations of the orthogonal matching pursuit (OMP). This result shows that in a probabilistic sense, the OMP is almost optimal for exact recovery. Second, we prove the Lebesgue-type inequalities for the weak Chebyshev gree... View full abstract»

• ### Near-Optimal Adaptive Compressed Sensing

Publication Year: 2014, Page(s):4001 - 4012
Cited by:  Papers (40)
| | PDF (1644 KB) | HTML

This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed compressive adaptive sense and search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible signal-to-noise-ratio (SNR) levels, improving on previous work in adaptive compressed sensing. Like traditional compressed sensing based on random nonadaptive ... 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