# IEEE Transactions on Information Theory

## Issue 5 • May 2019

Purchase of this issue is not available.

## Filter Results

Displaying Results 1 - 25 of 43

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

Publication Year: 2019, Page(s): C2
| PDF (144 KB)
• ### On Spectral Design Methods for Quasi-Cyclic Codes

Publication Year: 2019, Page(s):2637 - 2647
| | PDF (542 KB) | HTML

A method is provided for constructing upper triangular square matrices over the univariate polynomial ring over a finite field, under certain constraints on the eigenvalues of the matrices. In some cases of interest, the degree of the determinant of such matrices is shown to be the smallest possible. The method is then applied to construct generator polynomial matrices of quasi-cyclic codes for co... View full abstract»

• ### Locality and Availability of Array Codes Constructed From Subspaces

Publication Year: 2019, Page(s):2648 - 2660
Cited by:  Papers (1)
| | PDF (521 KB) | HTML

We study array codes which are based on subspaces of a linear space over a finite field, using spreads, $q$ -Steiner systems, and subspace transversal designs. We present several constructions of such codes which are $q$ -analogs of some known block codes,... View full abstract»

• ### Repairing Multiple Failures for Scalar MDS Codes

Publication Year: 2019, Page(s):2661 - 2672
Cited by:  Papers (1)
| | PDF (531 KB) | HTML

In distributed storage, erasure codes (like Reed–Solomon Codes) are often employed to provide reliability. In this setting, it is desirable to be able to repair one or more failed nodes while minimizing the repair bandwidth. In this paper, motivated by Reed-Solomon codes, we study the problem of repairing multiple failed nodes in a scalar MDS code. We extend the framework of (Guru... View full abstract»

• ### The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size

Publication Year: 2019, Page(s):2673 - 2695
| | PDF (636 KB) | HTML

The repair problem in distributed storage addresses recovery of the data encoded using an erasure code, for instance, a Reed–Solomon (RS) code. We consider the problem of repairing a single node or multiple nodes in RS-coded storage systems using the smallest possible amount of inter-nodal communication. According to the cut-set bound, communication cost of repairing View full abstract»

• ### Two or Few-Weight Trace Codes over ${\mathbb{F}_{q}}+u{\mathbb{F}_{q}}$

Publication Year: 2019, Page(s):2696 - 2703
| | PDF (506 KB) | HTML

Let $p$ be a prime number and $q=p^{s}$ for a positive integer $s$ . For any positive divisor $e$ of View full abstract»

• ### An Innovations Approach to Viterbi Decoding of Convolutional Codes

Publication Year: 2019, Page(s):2704 - 2722
| | PDF (1279 KB) | HTML

We introduce the notion of innovations for Viterbi decoding of convolutional codes. First, we define a kind of innovation corresponding to the received data, i.e., the input to a Viterbi decoder. Then, the structure of a scarce-state-transition (SST) Viterbi decoder is derived in a natural manner. It is shown that the newly defined innovation is just the input to the main decoder in an SST Viterbi... View full abstract»

• ### The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers

Publication Year: 2019, Page(s):2723 - 2735
| | PDF (673 KB) | HTML

Suppose $M$ records are replicated in $N$ servers (each storing all $M$ records), a user wants to privately retrieve one record by accessing the servers such that the identity of th... View full abstract»

• ### Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes

Publication Year: 2019, Page(s):2736 - 2759
| | PDF (840 KB) | HTML

Regenerating codes are efficient methods for distributed storage in storage networks, where node failures are common. They guarantee low cost data reconstruction and repair through accessing only a predefined number of arbitrarily chosen storage nodes in the network. In this paper, we consider two simultaneous extensions to the original regenerating codes framework introduced by Dimakis et... View full abstract»

• ### Nearly Optimal Sparse Group Testing

Publication Year: 2019, Page(s):2760 - 2773
| | PDF (1096 KB) | HTML

Group testing is the process of pooling arbitrary subsets from a set of ${n}$ items so as to identify, with a minimal number of tests, a “small” subset of ${d}$ defective items. In “classical” non-adaptive group testing, it is known that when View full abstract»

• ### On Capacities of the Two-User Union Channel With Complete Feedback

Publication Year: 2019, Page(s):2774 - 2781
| | PDF (378 KB) | HTML

The exact values of the optimal symmetric rate point in the Cover–Leung capacity region of the two-user union channel with complete feedback were determined by Willems when the size of the input alphabet is 2, and by Vinck et al. when the size is at least 6. We complete this line of research when the size of the input alphabet is 3, 4, or 5. The proof hinges on the technical lemma... View full abstract»

• ### Construction of Polar Codes With Sublinear Complexity

Publication Year: 2019, Page(s):2782 - 2791
| | PDF (495 KB) | HTML

Consider the problem of constructing a polar code of block length $N$ for a given transmission channel $W$ . Previous approaches require one to compute the reliability of the $N$ syn... View full abstract»

• ### Physical-Layer Schemes for Wireless Coded Caching

Publication Year: 2019, Page(s):2792 - 2807
| | PDF (3189 KB) | HTML

We investigate the potentials of applying the coded caching paradigm in wireless networks. In order to do this, we investigate physical layer schemes for downlink transmission from a multiantenna transmitter to several cache-enabled users. As the baseline scheme, we consider employing coded caching on the top of max–min fair multicasting, which is shown to be far from optimal at high-SNR values. O... View full abstract»

• ### Error Exponents for Dimension-Matched Vector Multiple Access Channels With Additive Noise

Publication Year: 2019, Page(s):2808 - 2823
| | PDF (442 KB) | HTML

We analyze a class of vector multiple access channels with additive noise, where the sum of the dimensions of the transmitted signals matches that of the received signal. We first focus on the case without power constraints, in the Poltyrev sense, using point process techniques. We find the Poltyrev capacity region for noise processes that are independent and identically distributed over channel u... View full abstract»

• ### Multiplexing Zero-Error and Rare-Error Communications Over a Noisy Channel

Publication Year: 2019, Page(s):2824 - 2837
| | PDF (511 KB) | HTML

Two independent data streams are to be transmitted over a noisy discrete memoryless channel with noiseless (ideal) feedback. Errors are tolerated only in the second stream, provided that they occur with vanishing probability. The rate of the error-free stream cannot, of course, exceed the channel’s zero-error feedback capacity, and nor can the sum of the streams’ rates exceed the channel’s Shannon... View full abstract»

• ### Second-Order Asymptotics for Communication Under Strong Asynchronism

Publication Year: 2019, Page(s):2838 - 2849
| | PDF (382 KB) | HTML

The capacity under strong asynchronism was recently shown to be essentially unaffected by the imposed decoding delay—the elapsed time between when information is available at the transmitter and when it is decoded—and the output sampling rate. This paper shows that, in contrast with capacity, the second-order term in the maximum rate expansion is sensitive to both parameters. When the receiver mus... View full abstract»

• ### A Characterization of Guesswork on Swiftly Tilting Curves

Publication Year: 2019, Page(s):2850 - 2871
Cited by:  Papers (1)
| | PDF (874 KB) | HTML

Given a collection of strings, each with an associated probability of occurrence, the guesswork of each of them is their position in a list ordered from most likely to least likely, breaking ties arbitrarily. The guesswork is central to several applications in information theory: average guesswork provides a lower bound on the expected computational cost of a sequential decoder to decode successfu... View full abstract»

• ### Quantum Sphere-Packing Bounds With Polynomial Prefactors

Publication Year: 2019, Page(s):2872 - 2898
| | PDF (690 KB) | HTML

We study lower bounds on the optimal error probability in classical coding over classical-quantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a var... View full abstract»

• ### Quantum Query Complexity of Entropy Estimation

Publication Year: 2019, Page(s):2899 - 2921
| | PDF (718 KB) | HTML

Estimation of Shannon and Rényi entropies of unknown discrete distributions is a fundamental problem in statistical property testing. In this paper, we give the first quantum algorithms for estimating $\alpha$ -Rényi entropies (Shannon entropy being 1-Rényi entropy). In particular, we demonstrate a quadratic quantum speedup f... View full abstract»

• ### Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources

Publication Year: 2019, Page(s):2922 - 2943
| | PDF (590 KB) | HTML

In this paper, a new model for arbitrarily varying classical-quantum channels is proposed. In this model, a jammer has side information. The communication scenario in which a jammer can select only classical inputs as a jamming sequence is considered in the first part of the paper. This situation corresponds to the standard model of arbitrarily varying classical-quantum channels. Two scenarios are... View full abstract»

• ### MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction

Publication Year: 2019, Page(s):2944 - 2952
| | PDF (727 KB) | HTML

The hull of linear codes has promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed–Solomon codes and extended generalized Reed–Solomon codes over finite fields with respect to the Euclidean inner product. Several infinite families of MDS codes with hulls of arbitrary dimensions are presented. As an application, using these MDS codes ... View full abstract»

• ### Network Estimation From Point Process Data

Publication Year: 2019, Page(s):2953 - 2975
| | PDF (1171 KB) | HTML

Consider observing a collection of discrete events within a network that reflect how network nodes influence one another. Such data are common in spike trains recorded from biological neural networks, interactions within a social network, and a variety of other settings. Data of this form may be modeled as self-exciting point processes, in which the likelihood of future events depends on the past ... View full abstract»

• ### Stable Recovery of Structured Signals From Corrupted Sub-Gaussian Measurements

Publication Year: 2019, Page(s):2976 - 2994
| | PDF (1100 KB) | HTML

This paper studies the problem of accurately recovering a structured signal from a small number of corrupted sub-Gaussian measurements. We consider three different procedures to reconstruct signal and corruption when different kinds of prior knowledge are available. In each case, we provide conditions (in terms of the number of measurements) for stable signal recovery from structured corruption wi... View full abstract»

• ### Data-Dependent Generalization Bounds for Multi-Class Classification

Publication Year: 2019, Page(s):2995 - 3021
| | PDF (1572 KB) | HTML

In this paper, we study data-dependent generalization error bounds that exhibit a mild dependency on the number of classes, making them suitable for multi-class learning with a large number of label classes. The bounds generally hold for empirical multi-class risk minimization algorithms using an arbitrary norm as the regularizer. Key to our analysis is new structural results for ... 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