# IEEE Transactions on Information Theory

## Issue 7 • July 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 48

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

Publication Year: 2018, Page(s): C2
| PDF (112 KB)
• ### Useful States and Entanglement Distillation

Publication Year: 2018, Page(s):4689 - 4708
| | PDF (964 KB) | HTML

We derive general upper bounds on the distillable entanglement of a mixed state under one-way and two-way local operations and classical communication (LOCC). In both cases, the upper bound is based on a convex decomposition of the state into “useful” and “useless” quantum states. By “useful,” we mean a state whose distillable entanglement is non-negative ... View full abstract»

• ### Communication Complexity of One-Shot Remote State Preparation

Publication Year: 2018, Page(s):4709 - 4728
| | PDF (638 KB) | HTML

Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another. Remote state preparation (RSP) is a similar distributed task in which the sender knows the entire classical description of the state to be sent. (This may also be viewed as the task of nonoblivious compression of a single sample from an ensem... View full abstract»

• ### Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations

Publication Year: 2018, Page(s):4729 - 4738
| | PDF (479 KB) | HTML

In this paper, we improve the layered implementation of arbitrary stabilizer circuits introduced by Aaronson and Gottesman in Phys. Rev. A 70 (052328), 2004: to implement a general stabilizer circuit, we reduce their 11-stage computation -H-C-P-C-P-C-H-P-C-P-C- over the gate set consisting of Hadamard, controlled-NOT, and phase gates, into a 7-stage computation of the form -C-CZ-P-H-P-CZ-C-. We sh... View full abstract»

• ### Bounds on Information Combining With Quantum Side Information

Publication Year: 2018, Page(s):4739 - 4757
| | PDF (1279 KB) | HTML

“Bounds on information combining” are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in classical information theory, particularly in coding and Shannon theory; entropy power inequalities are special instances of them. The arguably most el... View full abstract»

• ### Superadditivity of Quantum Relative Entropy for General States

Publication Year: 2018, Page(s):4758 - 4765
| | PDF (259 KB) | HTML

• ### Coding Theorem and Converse for Abstract Channels With Time Structure and Memory

Publication Year: 2018, Page(s):4993 - 5016
| | PDF (625 KB) | HTML

A coding theorem and converse are proved for a large-class of abstract stationary channels with time structure including the result by Kadota and Wyner (1972) on continuous-time real-valued channels as special cases. As main contribution, the coding theorem is proved for a significantly weaker condition on the channel output memory – called total ergodicity with respect to finite alphabet b... View full abstract»

Publication Year: 2018, Page(s):5017 - 5041
| | PDF (401 KB) | HTML

We consider a broadcast channel with three receivers and three-degraded message sets, i.e., the transmitter has a common message intended for all three receivers, a message intended for receivers 2 and 3, and a private message intended only for receiver 3. The messages are transmitted over a family of parallel degraded broadcast channels. In the most general case, the broadcast channel consists of... View full abstract»

• ### Capacity Regions of Two-Receiver Broadcast Erasure Channels With Feedback and Memory

Publication Year: 2018, Page(s):5042 - 5069
| | PDF (2447 KB) | HTML

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Two scenarios are considered: 1) when the transmitter has causal knowledge of the channel state (i.e., the state is visible) and 2) when the channel state is unknown at the transmitter, but observations of it are available at the t... View full abstract»

• ### Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel

Publication Year: 2018, Page(s):5070 - 5086
| | PDF (798 KB) | HTML

This paper contains two main contributions concerning the asymmetric broadcast channel. The first is an analysis of the exact random coding error exponents for both users, and the second is the derivation of universal decoders for both users. These universal decoders are certain variants of the maximum mutual information universal decoder, and they achieve the corresponding random coding exponents... View full abstract»

• ### Empirical and Strong Coordination via Soft Covering With Polar Codes

Publication Year: 2018, Page(s):5087 - 5100
| | PDF (615 KB) | HTML

We design polar codes for empirical coordination and strong coordination in two-node networks. Our constructions hinge on the fact that polar codes enable explicit low-complexity schemes for soft covering. We leverage this property to propose explicit and low-complexity coding schemes that achieve the capacity regions of both empirical coordination and strong coordination for sequ... View full abstract»

• ### On the Capacity of Write-Constrained Memories

Publication Year: 2018, Page(s):5101 - 5109
| | PDF (778 KB) | HTML

Rivest and Shamir introduced a write-once memory (WOM), a model of storage devices whose storage elements have restrictions on state transitions, and they presented some coding methods to reuse a WOM. An interesting question about a WOM is how efficiently we can reuse it with the best coding method, and as an answer to the question, Fu and Han Vinck determined the capacity of Fiat and Shamirȁ... View full abstract»

• ### Strong Secrecy for Interference Channels Based on Channel Resolvability

Publication Year: 2018, Page(s):5110 - 5130
| | PDF (633 KB) | HTML

Interference channels with confidential messages are studied under strong secrecy constraints, based on the framework of channel resolvability theory. It is shown that if the random binning rate for securing a confidential message is above the resolution of its corresponding wiretapped channel, strong secrecy can be guaranteed. The information-spectrum method introduced by Han and Verdú is ... 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