# IEEE Transactions on Information Theory

## Issue 3 • March 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 46

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

Publication Year: 2018, Page(s): C2
| |PDF (64 KB)
• ### A One-Shot Achievability Result for Quantum State Redistribution

Publication Year: 2018, Page(s):1425 - 1435
| |PDF (393 KB)

We study the problem of entanglement-assisted quantum state redistribution in the one-shot setting and provide a new achievability result on the quantum communication required. Our bounds are in terms of the max-relative entropy and the hypothesis testing relative entropy. We use the techniques of convex split and position-based decoding to arrive at our result. We show that our result is upper bo... View full abstract»

• ### A Generalized Quantum Slepian–Wolf

Publication Year: 2018, Page(s):1436 - 1453
| |PDF (438 KB)

In this paper, we consider a quantum generalization of the task considered by Slepian and Wolf regarding distributed source compression. In our task, Alice, Bob, Charlie, and Reference share a joint pure state. Alice and Bob wish to send a part of their respective systems to Charlie without collaborating with each other. We give achievability bounds for this task in the one-shot setting and provid... View full abstract»

• ### Separation Between Quantum Lovász Number and Entanglement-Assisted Zero-Error Classical Capacity

Publication Year: 2018, Page(s):1454 - 1460
| |PDF (225 KB)

Quantum Lovász number is a quantum generalization of the Lovász number in graph theory. It is the best known efficiently computable upper bound of the entanglement-assisted zero-error classical capacity of a quantum channel. However, it remains an intriguing open problem whether quantum entanglement can always enhance the zero-error capacity to achieve the quantum Lovász numbe... View full abstract»

• ### Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes

Publication Year: 2018, Page(s):1461 - 1470
| |PDF (900 KB)

In this paper, we construct a new family of quantum synchronizable codes from repeated-root cyclic codes of lengths $p^{s}$ and $lp^{s}$ over $mathbb {F}_{q}$ , where View full abstract»

• ### Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality

Publication Year: 2018, Page(s):1471 - 1480
| |PDF (910 KB)

We study the maximum weight matching (MWM) problem for general graphs through the max-product belief propagation (BP) and related Linear Programming (LP). The BP approach provides distributed heuristics for finding the maximum a posteriori (MAP) assignment in a joint probability distribution represented by a graphical model (GM), and respective LPs can be considered as continuous ... View full abstract»

• ### Lattice Codes Achieve the Capacity of Common Message Gaussian Broadcast Channels With Coded Side Information

Publication Year: 2018, Page(s):1481 - 1496
| |PDF (684 KB)

Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian noise channel, dirty-paper channel, Wyner–Ziv coding, coding for relay networks, and so forth. We consider the family of single-transmitter multiple-receiver... View full abstract»

• ### Extended Product and Integrated Interleaved Codes

Publication Year: 2018, Page(s):1497 - 1513
| |PDF (417 KB)

A new class of codes, Extended Product (EPC) Codes, consisting of a product code with a number of extra parities added, is presented and applications for erasure decoding are discussed. An upper bound on the minimum distance of EPC codes is given, as well as constructions meeting the bound for some relevant cases. A special case of EPC codes, Extended Integrated Interleaved (EII) codes, which natu... View full abstract»

• ### Speeding Up Distributed Machine Learning Using Codes

Publication Year: 2018, Page(s):1514 - 1529
| |PDF (1461 KB)

Codes are widely used in many engineering applications to offer robustness against noise. In large-scale systems, there are several types of noise that can affect the performance of distributed machine learning algorithms—straggler nodes, system failures, or communication bottlenecks—but there has been little interaction cutting across codes, machine... View full abstract»

• ### Variable Packet-Error Coding

Publication Year: 2018, Page(s):1530 - 1547
| |PDF (663 KB)

We consider a problem in which a source is encoded into $N$ packets, an unknown number of which are subject to adversarial errors en route to the decoder. We seek code designs for which the decoder is guaranteed to be able to reproduce the source subject to a certain distortion constraint when there are no packets errors, sub... View full abstract»

• ### Caching and Delivery via Interference Elimination

Publication Year: 2018, Page(s):1548 - 1560
| |PDF (699 KB)

We propose a new coded caching scheme where linear combinations of the file segments are cached at the users, for the cases where the number of files is no greater than the number of users. When a user requests a certain file in the delivery phase, the other file segments in the cached linear combinations can be viewed as interference. The proposed scheme combines rank-metric codes and maximum dis... View full abstract»

• ### LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel

Publication Year: 2018, Page(s):1561 - 1594
| |PDF (850 KB)

This paper deals with Low-Density Construction-A (LDA) lattices, which are obtained via Construction A from non-binary low-density parity-check codes. More precisely, a proof is provided that Voronoi constellations of LDA lattices achieve capacity of the AWGN channel under lattice encoding and decoding for every signal-to-noise ratio greater than 1. This is obtained after showing the same result f... View full abstract»

• ### Lattice Codes for Deletion and Repetition Channels

Publication Year: 2018, Page(s):1595 - 1603
| |PDF (1392 KB)

The construction of deletion codes for the editing metric is reduced to the construction of codes over the integers for the Manhattan metric by run length coding. The latter codes are constructed by expurgation of lattices’ translates. These lattices, in turn, are obtained from Construction A applied to binary codes and $mathbb {Z}_{4}$ View full abstract»

• ### Systematic Block Markov Superposition Transmission of Repetition Codes

Publication Year: 2018, Page(s):1604 - 1620
| |PDF (1825 KB)

In this paper, we propose systematic block Markov superposition transmission of repetition (BMST-R) codes, which can support a wide range of code rates but maintain essentially the same encoding/decoding hardware structure. The systematic BMST-R codes resemble the classical rate-compatible punctured convolutional codes, except that they are typically non-decodable by the Viterbi algorithm due to t... View full abstract»

• ### Information-Theoretically Secure Erasure Codes for Distributed Storage

Publication Year: 2018, Page(s):1621 - 1646
| |PDF (1699 KB)

Repair operations in erasure-coded distributed storage systems involve a lot of data movement. This can potentially expose data to malicious acts of passive eavesdroppers or active adversaries, putting security of the system at risk. This paper presents coding schemes and repair algorithms that ensure security of the data in the presence of passive eavesdroppers and active adversaries while mainta... View full abstract»

• ### Achieving Secrecy Capacity of the Gaussian Wiretap Channel With Polar Lattices

Publication Year: 2018, Page(s):1647 - 1665
| |PDF (1339 KB)

In this paper, an explicit scheme of wiretap coding based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. First, polar lattices are used to construct secrecy-good lattices for the mod- $Lambda _{s}$ Gaussian wiretap channel (GWC). Then, we propose an ex... View full abstract»

• ### Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization

Publication Year: 2018, Page(s):1666 - 1698
| |PDF (1019 KB)

Compressed sensing of simultaneously sparse and low-rank matrices enables recovery of sparse signals from a few linear measurements of their bilinear form. One important question is how many measurements are needed for a stable reconstruction in the presence of measurement noise. Unlike conventional compressed sensing for sparse vectors, where convex relaxation via the View full abstract»

• ### Sampling and Distortion Tradeoffs for Bandlimited Periodic Signals

Publication Year: 2018, Page(s):1706 - 1724
| |PDF (823 KB)

In this paper, the optimal sampling strategies (uniform or nonuniform) and distortion tradeoffs for Gaussian bandlimited periodic signals with additive white Gaussian noise are studied. Our emphasis is on characterizing the optimal sampling locations as well as the optimal presampling filter to minimize the reconstruction distortion. We first show that to achieve the optimal distortion, no presamp... View full abstract»

• ### Model Consistency of Partly Smooth Regularizers

Publication Year: 2018, Page(s):1725 - 1737
| |PDF (441 KB)

This paper studies least-square regression penalized with partly smooth convex regularizers. This class of penalty functions is very large and versatile, and allows to promote solutions conforming to some notion of low complexity. Indeed, such penalties/regularizers force the corresponding solutions to belong to a low-dimensional manifold (the so-called model), which remains stable when the argume... View full abstract»

• ### Convex and Nonconvex Formulations for Mixed Regression With Two Components: Minimax Optimal Rates

Publication Year: 2018, Page(s):1738 - 1766
| |PDF (531 KB)

We consider the mixed regression problem with two components, under adversarial and stochastic noise. We give a convex optimization formulation that provably recovers the true solution, as well as a nonconvex formulation that works under more general settings and remains tractable. Upper bounds are provided on the recovery errors for both arbitrary noise and stochastic noise models. We also give m... View full abstract»

• ### Denoising Flows on Trees

Publication Year: 2018, Page(s):1767 - 1783
| |PDF (746 KB)

We study the estimation of flows on trees, a structured generalization of isotonic regression. A tree flow is defined recursively as a positive flow value into a node that is partitioned into an outgoing flow to the children nodes, with some amount of the flow possibly leaking outside. We study the behavior of the least squares estimator for flows, and the associated minimax lower bounds. We chara... View full abstract»

• ### Approximate Asymptotic Distribution of Locally Most Powerful Invariant Test for Independence: Complex Case

Publication Year: 2018, Page(s):1784 - 1799
| |PDF (1523 KB)

Usually, it is very difficult to determine the exact distribution for a test statistic. In this paper, asymptotic distributions of locally most powerful invariant test for independence of complex Gaussian vectors are developed. In particular, its cumulative distribution function (CDF) under the null hypothesis is approximated by a function of chi-squared CDFs. Moreover, the CDF co... View full abstract»

• ### A Multivariate Hawkes Process With Gaps in Observations

Publication Year: 2018, Page(s):1800 - 1811
| |PDF (1039 KB)

Given a collection of entities (or nodes) in a network and our intermittent observations of activities from each entity, an important problem is to learn the hidden edges depicting directional relationships among these entities. Here, we study causal relationships (excitations) that are realized by a multivariate Hawkes process (MHP). The MHP and its variations (spatio-temporal point processes) ha... 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