# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 47

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

Publication Year: 2016, Page(s): C2
| PDF (171 KB)
• ### $f$ -Divergence Inequalities

Publication Year: 2016, Page(s):5973 - 6006
Cited by:  Papers (8)
| | PDF (867 KB) | HTML

This paper develops systematic approaches to obtain f -divergence inequalities, dealing with pairs of probability measures defined on arbitrary alphabets. Functional domination is one such approach, where special emphasis is placed on finding the best possible constant upper bounding a ratio of f -divergences. Another approach used for the derivation of bounds among f -divergences relies on moment... View full abstract»

• ### Entropy Region and Convolution

Publication Year: 2016, Page(s):6007 - 6018
Cited by:  Papers (2)
| | PDF (931 KB) | HTML

The entropy region is constructed from vectors of random variables by collecting Shannon entropies of all subvectors. Its shape is studied here by means of polymatroidal constructions, notably by convolution. The closure of the region is decomposed into the direct sum of tight and modular parts, reducing the study to the tight part. The relative interior of the reduction belongs to the entropy reg... View full abstract»

• ### Directed Information on Abstract Spaces: Properties and Variational Equalities

Publication Year: 2016, Page(s):6019 - 6052
Cited by:  Papers (5)
| | PDF (731 KB) | HTML

Directed information or its variants are utilized extensively in the characterization of the capacity of channels with memory and feedback, nonanticipative lossy data compression, and their generalizations to networks. In this paper, we derive several functional and topological properties of directed information, defined on general abstract alphabets (complete separable metric spaces), using the t... View full abstract»

• ### Estimating the Directed Information and Testing for Causality

Publication Year: 2016, Page(s):6053 - 6067
Cited by:  Papers (1)
| | PDF (325 KB) | HTML

The problem of estimating the directed information rate between two discrete processes (Xn) and (Yn) via the plug-in (or maximum-likelihood) estimator is considered. When the joint process ((Xn, Yn)) is a Markov chain of a given memory length, the plug-in estimator is shown to be asymptotically Gaussian and to converge at the optimal rate O(1/√n) ... View full abstract»

• ### Mutual Information Bounds via Adjacency Events

Publication Year: 2016, Page(s):6068 - 6080
| | PDF (525 KB) | HTML

The mutual information between two jointly distributed random variables X and Y is a functional of the joint distribution PXY, which is sometimes difficult to handle or estimate. A coarser description of the statistical behavior of (X, Y) is given by the marginal distributions PX, PY and the adjacency relation induced by the joint distribution, where x and y are adjacent if P(x, y) > 0. We deri... View full abstract»

• ### Secure Cascade Channel Synthesis

Publication Year: 2016, Page(s):6081 - 6094
Cited by:  Papers (2)
| | PDF (799 KB) | HTML

We consider the problem of generating correlated random variables in a distributed fashion, where communication is constrained to a cascade network. The first node in the cascade observes an i.i.d. sequence $X^{n}$ locally before initiating communication along the cascade. All nodes share bits of common randomness that are in... View full abstract»

• ### List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability

Publication Year: 2016, Page(s):6095 - 6110
| | PDF (323 KB) | HTML

In a recent work, S. Nitinawarat obtained a lower bound and an upper bound for the minimum list size in list decoding for an arbitrarily varying multiple access channel (AVMAC), for which the interior of the capacity region of deterministic list codes is nonempty. In the same paper, he proved that for a binary AVMAC, the minimum list size is finite, if and only if the interior of the capacity regi... View full abstract»

• ### Nonasymptotic Noisy Lossy Source Coding

Publication Year: 2016, Page(s):6111 - 6123
Cited by:  Papers (2)
| | PDF (494 KB) | HTML

This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through a noisy channel. While this problem is asymptotically equivalent to a noiseless lossy source coding problem with a modified distortion function, nonasymptotically there is a noticeable gap in how fa... View full abstract»

• ### Entropy and Source Coding for Integer-Dimensional Singular Random Variables

Publication Year: 2016, Page(s):6124 - 6154
| | PDF (829 KB) | HTML

Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous- has not been available so far. Here, we present such an extension for the practically relevant class of integer-dimensional singular random variables. The proposed entropy definition contains the entropy of discrete random va... View full abstract»

• ### The Shannon Lower Bound Is Asymptotically Tight

Publication Year: 2016, Page(s):6155 - 6161
Cited by:  Papers (7)
| | PDF (212 KB) | HTML

The Shannon lower bound is one of the few lower bounds on the rate-distortion function that holds for a large class of sources. In this paper, which considers exclusively norm-based difference distortion measures, it is demonstrated that its gap to the rate-distortion function vanishes as the allowed distortion tends to zero for all sources having finite differential entropy and whose integer part... View full abstract»

• ### Optimal Quantization for Distribution Synthesis

Publication Year: 2016, Page(s):6162 - 6172
Cited by:  Papers (2)
| | PDF (342 KB) | HTML

Finite precision approximations of discrete probability distributions are considered, applicable for distribution synthesis, e.g., probabilistic shaping. Two algorithms are presented that find the optimal M-type approximation Q of a distribution P in terms of the variational distance II Q - PII1 and the informational divergence D( QIIP). Bounds on the approximation errors are derived an... View full abstract»

• ### Identification Rate, Search and Memory Complexity Tradeoff: Fundamental Limits

Publication Year: 2016, Page(s):6173 - 6188
Cited by:  Papers (1)
| | PDF (4577 KB) | HTML

In an information-theoretic framework, we introduce a two-stage decoding scheme capable of achieving identification capacity to address search and memory complexities in large-scale identification systems. This two-stage decoding procedure is accomplished as follows. For a given query, at the first stage, a list of cluster indices is estimated. Then, at the second stage, refinement checks are perf... View full abstract»

• ### Secret Key-Based Identification and Authentication With a Privacy Constraint

Publication Year: 2016, Page(s):6189 - 6203
| | PDF (1159 KB) | HTML

We consider the problem of identification and authentication based on secret key generation from some usergenerated source data (e.g., a biometric source). The goal is to reliably identify users pre-enrolled in a database as well as authenticate them based on the estimated secret key while preserving the privacy of the enrolled data and of the generated keys. We characterize the optimal tradeoff r... View full abstract»

• ### Security in Locally Repairable Storage

Publication Year: 2016, Page(s):6204 - 6217
Cited by:  Papers (1)
| | PDF (401 KB) | HTML

In this paper we extend the notion of locally repairable codes to secret sharing schemes. The main problem that we consider is to find optimal ways to distribute the shares of a secret among a set of storage-nodes (participants) such that the content of each node (share) can be recovered by using the contents of only few other nodes, and at the same time the secre... View full abstract»

• ### Security Concerns in Minimum Storage Cooperative Regenerating Codes

Publication Year: 2016, Page(s):6218 - 6232
| | PDF (1178 KB) | HTML

Here, we revisit the problem of exploring the secrecy capacity of minimum storage cooperative regenerating (MSCR) codes under the (l2 l2)-eavesdropper model, where the eavesdropper can observe the data stored on l1 nodes and the repair downloads of an additional l2 nodes. Compared to minimum storage regenerating (MSR) codes which support only single node repairs, M... View full abstract»

• ### State Amplification Subject to Masking Constraints

Publication Year: 2016, Page(s):6233 - 6250
| | PDF (727 KB) | HTML

This paper considers a state dependent broadcast channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey (“amplify”) the channel state sequence to Bob while “masking” it from Eve. The extent to which the state sequence cannot be masked from Eve is referred to as leakage. This can be viewed as a secrecy problem, where we ... View full abstract»

• ### Breaking RSA Generically Is Equivalent to Factoring

Publication Year: 2016, Page(s):6251 - 6259
| | PDF (247 KB) | HTML

Let $N$ be a random variable distributed according to some appropriate distribution over the set of products of two primes, such that factoring $N$ is believed to be hard. The RSA assumption states that, given an View full abstract»

• ### On the Security of 2-Key Triple DES

Publication Year: 2016, Page(s):6260 - 6267
Cited by:  Papers (1)
| | PDF (197 KB) | HTML

This paper reconsiders the security offered by two-key triple DES, an encryption technique that remains widely used despite recently being de-standardised by NIST. A generalization of the 1990 van Oorschot-Wiener attack is described, constituting the first advance in cryptanalysis of two-key triple DES since 1990. We give further attack enhancements that together imply that the widely used estimat... View full abstract»

• ### Binary Linear Locally Repairable Codes

Publication Year: 2016, Page(s):6268 - 6283
Cited by:  Papers (6)
| | PDF (1324 KB) | HTML

Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do not explicitly take into consideration the field size q, i.e., the size of the code alphabet. In particular, for the binary case, only a few results are known.... View full abstract»

• ### Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes

Publication Year: 2016, Page(s):6284 - 6299
| | PDF (826 KB) | HTML

In this paper, we present a fast Fourier transform algorithm over extension binary fields, where the polynomial is represented in a non-standard basis. The proposed Fourier-like transform requires O(h lg(h)) field operations, where h is the number of evaluation points. Based on the proposed Fourier-like algorithm, we then develop the encoding/decoding algorithms for (n = 2m, k) Reed-Sol... View full abstract»

• ### The Next-to-Minimal Weights of Binary Projective Reed–Muller Codes

Publication Year: 2016, Page(s):6300 - 6303
| | PDF (166 KB) | HTML

Projective Reed-Muller codes were introduced by Lachaud in 1988 and their dimension and minimum distance were determined by Serre and Sorensen in 1991. In coding theory, one is also interested in the higher Hamming weights, to study the code performance. Yet, not many values of the higher Hamming weights are known for these codes, not even the second lowest weight (also known as the next-to-minima... View full abstract»

• ### Stopping Sets of Hermitian Codes

Publication Year: 2016, Page(s):6304 - 6314
| | PDF (307 KB) | HTML

Combinatorial structures called stopping sets are useful in analyzing the performance of a linear code when coupled with an iterative decoding algorithm over an erasure channel. In this paper, we consider stopping sets of Hermitian codes. View full abstract»

• ### New Bounds and Constructions for Multiply Constant-Weight Codes

Publication Year: 2016, Page(s):6315 - 6327
Cited by:  Papers (2)
| | PDF (751 KB) | HTML

Multiply constant-weight codes (MCWCs) were introduced recently to improve the reliability of certain physically unclonable function response. In this paper, the bounds of MCWCs and the constructions of optimal MCWCs are studied. First, we derive three different types of upper bounds which improve the Johnson-type bounds given by Chee et al. for some parameters. The asymptotic lower bound of MCWCs... 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