Scheduled System Maintenance
We are currently undergoing maintenance that may cause intermittent performance issues. We apologize for any inconvenience.

# IEEE Transactions on Information Theory

## Issue 10 • Oct. 2018

The purchase and pricing options for this item are unavailable. Select items are only available as part of a subscription package. You may try again later or contact us for more information.

## Filter Results

Displaying Results 1 - 25 of 36

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

Publication Year: 2018, Page(s): C2
| PDF (144 KB)
• ### On Independence and Capacity of Multidimensional Semiconstrained Systems

Publication Year: 2018, Page(s):6461 - 6483
| | PDF (880 KB) | HTML

We find a new formula for the limit of the capacity of certain sequences of multidimensional semiconstrained systems as the dimension tends to infinity. We do so by generalizing the notion of independence entropy, originally studied in the context of constrained systems, to the study of semiconstrained systems. Using the independence entropy, we obtain new lower bounds on the capacity of multidime... View full abstract»

• ### Information Sets From Defining Sets for Reed–Muller Codes of First and Second Order

Publication Year: 2018, Page(s):6484 - 6497
| | PDF (775 KB) | HTML

Reed–Muller codes belong to the family of affine-invariant codes. As such codes, they have a defining set that determines them uniquely, and they are extensions of cyclic group codes. In this paper, we identify those cyclic codes with multidimensional abelian codes and we use the techniques introduced by Bernal and Simón to construct information sets for them from their defining set. For first- an... View full abstract»

• ### Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum

Publication Year: 2018, Page(s):6498 - 6505
Cited by:  Papers (1)
| | PDF (598 KB) | HTML

Codebooks with low-coherence have wide utilization in many fields, such as direct spread code division multiple access communications, compressed sensing and so on. There are two major ingredients in this paper. The first is to present a new character sum, the hyper Eisenstein sum and study the properties of this character sum. As an application, the second ingredient is to propose two constructio... View full abstract»

• ### MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth

Publication Year: 2018, Page(s):6506 - 6525
| | PDF (842 KB) | HTML

This paper addresses the problem of constructing maximum distance separable (MDS) codes that enable exact reconstruction (repair) of each code block by downloading a small amount of information from the remaining code blocks. The total amount of information flow from the remaining code blocks during this reconstruction process is referred to as repair bandwidth of the underlying code. Existing con... View full abstract»

• ### On Short Cycle Enumeration in Biregular Bipartite Graphs

Publication Year: 2018, Page(s):6526 - 6535
| | PDF (559 KB) | HTML

A number of recent works have used a variety of combinatorial constructions to derive Tanner graphs for LDPC codes and some of these LDPC codes have been shown to perform well in terms of their probability of errors and error floors. Such graphs are bipartite and many of these constructions yield biregular graphs, where the degree of left vertices is a constant View full abstract»

• ### Minimal Binary Linear Codes

Publication Year: 2018, Page(s):6536 - 6545
| | PDF (490 KB) | HTML

In addition to their applications in data communication and storage, linear codes also have nice applications in combinatorics and cryptography. Minimal linear codes, a special type of linear codes, are preferred in secret sharing. In this paper, a necessary and sufficient condition for a binary linear code to be minimal is derived. This condition enables us to obtain three infinite families of mi... View full abstract»

• ### Explicit Capacity Approaching Coding for Interactive Communication

Publication Year: 2018, Page(s):6546 - 6560
| | PDF (495 KB) | HTML

We show anexplicit(that is, efficient and deterministic) capacity approaching interactive coding scheme that simulates any interactive protocol under random errors with nearly optimal communication rate. Specifically, over the binary symmetric channel with crossover probability$\epsilon$, our coding scheme ach... View full abstract»

• ### On the Nonexistence of Perfect Splitter Sets

Publication Year: 2018, Page(s):6561 - 6566
| | PDF (175 KB) | HTML

Splitter sets are closely related to lattice tilings, and have applications in flash memories and conflict avoiding codes. In this paper, we prove some nonexistence results for nonsingular perfect splitter sets. We also give some necessary conditions for the existence of purely singular perfect splitter sets. Finally, we apply these results to purely singular perfect View full abstract»

• ### Repairing Reed-Solomon Codes With Multiple Erasures

Publication Year: 2018, Page(s):6567 - 6582
Cited by:  Papers (1)
| | PDF (1330 KB) | HTML

Despite their exceptional error-correcting properties, Reed–Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth. A naive repair approach would require for the whole file to be reconstructed in order to recover a single erased codeword symbol. In a recent work, Guruswami and Wootters (STOC’16) proposed a single er... View full abstract»

• ### On Linear Complementary Pairs of Codes

Publication Year: 2018, Page(s):6583 - 6589
| | PDF (474 KB) | HTML

We study linear complementary pairs (LCP) of codes$(C, D)$, where both codes belong to the same algebraic code family. We especially investigate constacyclic and quasi-cyclic LCP of codes. We obtain characterizations for LCP of constacyclic codes and LCP of quasi-cyclic codes. Our result for the constacyclic complementary pairs... View full abstract»

• ### The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance

Publication Year: 2018, Page(s):6590 - 6603
| | PDF (2544 KB) | HTML

A class of cyclic codes has recently been decoded by using the weak-locator polynomials instead of the conventional error-locator polynomials. In this paper, a generalization of weak-locator polynomials to the multivariate cases, called the multivariate weak-locator polynomials, is defined, and a new matrix whose determinant can be expressed as a multivariate weak-locator polynomial is developed f... View full abstract»

• ### Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes

Publication Year: 2018, Page(s):6604 - 6619
| | PDF (1365 KB) | HTML

The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binaryconstant subblock-composition codes(CSCCs), where each codeword is partitioned into equal sized subblocks, and every subblock has the same fixed we... View full abstract»

• ### A Gaussian Process Regression Model for Distribution Inputs

Publication Year: 2018, Page(s):6620 - 6637
| | PDF (599 KB) | HTML

Monge-Kantorovich distances, otherwise known as Wasserstein distances, have received a growing attention in statistics and machine learning as a powerful discrepancy measure for probability distributions. In this paper, we focus on forecasting a Gaussian process indexed by probability distributions. For this, we provide a family of positive definite kernels built using transportation based distanc... View full abstract»

• ### Robustness to Unknown Error in Sparse Regularization

Publication Year: 2018, Page(s):6638 - 6661
| | PDF (1000 KB) | HTML

Quadratically constrained basis pursuit has become a popular device in sparse regularization; in particular, in the context of compressed sensing. However, the majority of theoretical error estimates for this regularizer assume ana prioribound on the noise level, which is usually lacking in practice. In this paper, we develop stability and robustness estimates, which remove this a... View full abstract»

• ### Mutual Information, Relative Entropy and Estimation Error in Semi-Martingale Channels

Publication Year: 2018, Page(s):6662 - 6671
| | PDF (278 KB) | HTML

Fundamental relations between information and estimation have been established in the literature for the continuous time Gaussian and Poisson channels. In this paper, we demonstrate that such relations hold for a much larger family of continuous-time channels. We introduce the family of semi-martingale channels where the channel output is a semi-martingale stochastic process, and the channel input... View full abstract»

• ### Minimax Estimation of the$L_{1}$Distance

Publication Year: 2018, Page(s):6672 - 6706
| | PDF (936 KB) | HTML

We consider the problem of estimating the$L_{1}$distance between two discrete probability measures$P$and$Q$from empirical data in a nonasymptotic and large alphabet setting. When View full abstract»

• ### Inexact Gradient Projection and Fast Data Driven Compressed Sensing

Publication Year: 2018, Page(s):6707 - 6721
| | PDF (2000 KB) | HTML

We study the convergence of the iterative projected gradient (IPG) algorithm for arbitrary (possibly non-convex) sets when both the gradient and projection oracles are computed approximately. We consider different notions of approximation of which we show that the progressive fixed precision and the$(1+ \varepsilon)$-optimal or... View full abstract»

• ### On the Papoulis Sampling Theorem: Some General Conditions

Publication Year: 2018, Page(s):6722 - 6730
| | PDF (256 KB) | HTML

Some general conditions for multichannel sampling are established for wide sense stationary sequences with spectral density. First, necessary and sufficient conditions are given for these processes so that they are linearly determined by the samples obtained from a multichannel sampling scheme. Some results are studied for stationary sequences and then applied to the problem of sampling, not neces... View full abstract»

• ### Kalman Filtering Over Fading Channels: Zero–One Laws and Almost Sure Stabilities

Publication Year: 2018, Page(s):6731 - 6742
| | PDF (348 KB) | HTML

In this paper, we investigate probabilistic stability of Kalman filtering over fading channels modeled by *-mixing random processes, where channel fading is allowed to generate non-stationary packet dropouts with temporal and/or spatial correlations. Upper/lower almost sure (a.s.) stabilities and absolutely upper/lower a.s. stabilities are defined for characterizing the sample-path behaviors of th... View full abstract»

• ### Generalization of the de Bruijn Identity to General$\phi$-Entropies and$\phi$-Fisher Informations

Publication Year: 2018, Page(s):6743 - 6758
| | PDF (502 KB) | HTML

In this paper, we propose generalizations of the de Bruijn identity based on extensions of the Shannon entropy, Fisher information and their associated divergences or relative measures. The foundations of these generalizations are the$\phi$-entropies and divergences of the Csiszár (or Salicrú) class considered within a multidi... View full abstract»

• ### Characterizations of Two Channel Orderings: Input-Degradedness and the Shannon Ordering

Publication Year: 2018, Page(s):6759 - 6770
| | PDF (447 KB) | HTML

The ordering of communication channels was first introduced by Shannon. In this paper, we aim to find characterizations of two orderings: input-degradedness and the Shannon ordering. A channel$W$is said to be input-degraded from another channel$W'$if View full abstract»

• ### On Zero-Error Capacity of Binary Channels With One Memory

Publication Year: 2018, Page(s):6771 - 6778
| | PDF (1395 KB) | HTML

The zero-error capacity of a channel is defined as the maximum rate at which it is possible to transmit information with zero probability of error. In this paper, we settle all previously unsolved cases for the zero-error capacity of binary channels with one memory. View full abstract»

• ### A Unified Random Coding Bound

Publication Year: 2018, Page(s):6779 - 6802
| | PDF (990 KB) | HTML

In this paper, we prove a unified achievability bound that generalizes and improves random coding bounds for any combination of source coding, channel coding, joint source–channel coding, and coding for computing problems assuming blockwise node operation. As a general network setup, we consider an acyclic discrete memoryless network, where the network demands and constraints are specified by a jo... 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