Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Issue 12 • Dec. 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 29

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)
• Monte Carlo Methods for the Ferromagnetic Potts Model Using Factor Graph Duality

Publication Year: 2018, Page(s):7449 - 7464
| | PDF (1350 KB) | HTML

Normal factor graph duality offers new possibilities for Monte Carlo algorithms in graphical models. Specifically, we consider the problem of estimating the partition function of the ferromagnetic Ising and Potts models by Monte Carlo methods, which are known to work well at high temperatures but to fail at low temperatures. We propose Monte Carlo methods (uniform sampling and importance sampling)... View full abstract»

• Codes on Graphs: Models for Elementary Algebraic Topology and Statistical Physics

Publication Year: 2018, Page(s):7465 - 7487
| | PDF (3027 KB) | HTML

This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic$(n, k)$group codes and their information sets; normal realizations of homology and cohomolo... View full abstract»

• A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers–Wannier Duality

Publication Year: 2018, Page(s):7488 - 7510
Cited by:  Papers (1)
| | PDF (2281 KB) | HTML

Algebraic topology studies topological spaces with the help of tools from abstract algebra. The main focus of this paper is to show that many concepts from algebraic topology can be conveniently expressed in terms of (normal) factor graphs. As an application, we give an alternative proof of a classical duality result of Kramers and Wannier, which expresses the partition function of the 2-D Ising m... View full abstract»

• Simultaneous Partial Inverses and Decoding Interleaved Reed–Solomon Codes

Publication Year: 2018, Page(s):7511 - 7528
| | PDF (385 KB) | HTML

This paper introduces the simultaneous partial-inverse problem (SPI) for polynomials and develops its application to decoding interleaved Reed–Solomon codes beyond half the minimum distance. While closely related both to standard key equations and to well-known Padé approximation problems, the SPI problem stands out in several respects. First, the SPI problem has a unique solution (up to a scale f... View full abstract»

• Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing

Publication Year: 2018, Page(s):7529 - 7550
| | PDF (1212 KB) | HTML

This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth efficient repair of a single-failed node. This paper focuses on the tradeoff between the amount of data stored and repair bandwidth in the CMR ... View full abstract»

• Binary Images of${\mathbb{Z}_2\mathbb{Z}_4}$-Additive Cyclic Codes

Publication Year: 2018, Page(s):7551 - 7556
| | PDF (485 KB) | HTML

A${\mathbb {Z}}_{2}{\mathbb {Z}}_{4}$-additive code${\mathcal{ C}}\subseteq {\mathbb {Z}}_{2}^\alpha \times {\mathbb {Z}}_{4}^\beta$is called cyclic if the set of coordinates can be partitioned into two subsets, the set of View full abstract»

• Communication Cost for Updating Linear Functions When Message Updates are Sparse: Connections to Maximally Recoverable Codes

Publication Year: 2018, Page(s):7557 - 7576
| | PDF (593 KB) | HTML

We consider a communication problem in which an update of the source message needs to be conveyed to one or more distant receivers that are interested in maintaining specific linear functions of the source message. The setting is one in which the updates are sparse in nature, and where neither the source nor the receiver(s) is aware of the exactdifference vector, but only know the... View full abstract»

• Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes

Publication Year: 2018, Page(s):7577 - 7593
| | PDF (896 KB) | HTML

An error-erasure channel is a simple noise model that introduces both errors and erasures. While the two types of errors can be corrected simultaneously with error-correcting codes, it is also known that any linear code allows for first correcting errors and then erasures in two-step decoding. In particular, a carefully designed parity-check matrix not only allows for separating erasures from erro... View full abstract»

• A Statistical Model for Motifs Detection

Publication Year: 2018, Page(s):7594 - 7612
| | PDF (448 KB) | HTML

We consider a statistical model for the problem of finding subgraphs with specified topology in an otherwise random graph. This task plays an important role in the analysis of social and biological networks. In these types of networks, small subgraphs with a specific structure have important functional roles, and they are referred to as motifs. Within this model, one or multiple copies of a subgra... View full abstract»

• Extreme Compressive Sampling for Covariance Estimation

Publication Year: 2018, Page(s):7613 - 7635
| | PDF (601 KB) | HTML Media

This paper studies the problem of estimating the covariance of a collection of vectors using only highly compressed measurements of each vector. An estimator based on back-projections of these compressive samples is proposed and analyzed. A distribution-free analysis shows that by observing just a single linear measurement of each vector, one can consistently estimate the covariance matrix, in bot... View full abstract»

• Lower Bounds on Exponential Moments of the Quadratic Error in Parameter Estimation

Publication Year: 2018, Page(s):7636 - 7648
| | PDF (516 KB) | HTML

Considering the problem of risk-sensitive parameter estimation, we propose a fairly wide family of lower bounds on the exponential moments of the quadratic error, both in the Bayesian and the non-Bayesian regime. This family of bounds, which is based on a change of measures, offers considerable freedom in the choice of the reference measure, and our efforts are devoted to explore this freedom to a... View full abstract»

• Approximation by Combinations of ReLU and Squared ReLU Ridge Functions With$\ell^1$and$\ell^0$Controls

Publication Year: 2018, Page(s):7649 - 7656
| | PDF (274 KB) | HTML

We establish$L^{\infty }$and$L^{2}$error bounds for functions of many variables that are approximated by linear combinations of rectified linear unit (ReLU) and squared ReLU ridge functions with$\ell ^{1}$ View full abstract»

• A Joint Typicality Approach to Compute–Forward

Publication Year: 2018, Page(s):7657 - 7685
| | PDF (1246 KB) | HTML

This paper presents a joint typicality framework for encoding and decoding nested linear codes in multi-user networks. This framework provides a new perspective on compute–forward within the context of discrete memoryless networks. In particular, it establishes an achievable rate region for computing a linear combination over a discrete memoryless multiple-access channel (MAC). When specialized to... View full abstract»

• Common-Message Broadcast Channels With Feedback in the Nonasymptotic Regime: Stop Feedback

Publication Year: 2018, Page(s):7686 - 7718
Cited by:  Papers (2)
| | PDF (919 KB) | HTML

We investigate the maximum coding rate for a given average blocklength and error probability over a$K$-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. For the point-to-point case, Polyanskiyet al.(2011) demonstrated tha... View full abstract»

• Common-Message Broadcast Channels With Feedback in the Nonasymptotic Regime: Full Feedback

Publication Year: 2018, Page(s):7719 - 7741
| | PDF (690 KB) | HTML

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code setup, we establish nonasymptotic converse and achievability bounds. An asymptotic analysis of these bounds reveals that feedback improves the second-order ter... View full abstract»

• Universal Sampling Rate Distortion

Publication Year: 2018, Page(s):7742 - 7758
| | PDF (454 KB) | HTML

We examine the coordinated and universal rate-efficient sampling of a subset of correlated discrete memoryless sources followed by lossy compression of the sampled sources. The goal is to reconstruct a predesignated subset of sources within a specified level of distortion. The combined sampling mechanism and rate distortion code are universal in that they are devised to perform robustly without ex... View full abstract»

• Spatiotemporal Information Coupling in Network Navigation

Publication Year: 2018, Page(s):7759 - 7779
Cited by:  Papers (1)
| | PDF (1199 KB) | HTML

Network navigation, encompassing both spatial and temporal cooperation to locate mobile agents, is a key enabler for numerous emerging location-based applications. In such cooperative networks, the positional information obtained by each agent is a complex compound due to the interaction among its neighbors. Thisinformation couplingmay result in poor performance: algorithms that d... View full abstract»

• Network Coherence Time Matters—Aligned Image Sets and the Degrees of Freedom of Interference Networks With Finite Precision CSIT and Perfect CSIR

Publication Year: 2018, Page(s):7780 - 7791
| | PDF (622 KB) | HTML

This paper obtains the first degrees of freedom (DoFs) bound that is provably sensitive tonetworkcoherence time, i.e., coherence time in an interference network, where all channels experience the same coherence patterns. This is accomplished by a novel adaptation of the aligned image sets bound and settles various open problems noted previously by Naderi and Avestimehr and by Gou<... View full abstract»

• On Privacy Amplification, Lossy Compression, and Their Duality to Channel Coding

Publication Year: 2018, Page(s):7792 - 7801
| | PDF (469 KB) | HTML

We examine the task of privacy amplification from information-theoretic and coding-theoretic points of view. In the former, we give a one-shot characterization of the optimal rate of privacy amplification against classical adversaries in terms of the optimal type-II error in asymmetric hypothesis testing. The converse significantly improves on previous bounds based on smooth min-entropy by Watanab... View full abstract»

• Energy-Constrained Private and Quantum Capacities of Quantum Channels

Publication Year: 2018, Page(s):7802 - 7827
| | PDF (717 KB) | HTML

This paper establishes a general theory of energy-constrained quantum and private capacities of quantum channels. We begin by defining various energy-constrained communication tasks, including quantum communication with a uniform energy constraint, entanglement transmission with an average energy constraint, private communication with a uniform energy constraint, and secret key transmission with a... View full abstract»

• On the Capacity of a Class of Signal-Dependent Noise Channels

Publication Year: 2018, Page(s):7828 - 7846
| | PDF (608 KB) | HTML

In some applications, the variance of additive measurement noise depends on the signal that we aim to measure. For instance, additive signal-dependent Gaussian noise (ASDGN) channel models are used in molecular and optical communication. Herein, we provide lower and upper bounds on the capacity of additive signal-dependent noise (ASDN) channels. The first lower bound is based on an extension of ma... View full abstract»

• Universal Lattice Codes for MIMO Channels

Publication Year: 2018, Page(s):7847 - 7865
| | PDF (560 KB) | HTML

We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned channel realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. These techniques, along with algebraic pro... View full abstract»

• State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results

Publication Year: 2018, Page(s):7866 - 7882
| | PDF (828 KB) | HTML

This paper studies a two-user state-dependent Gaussian multiple-access channel (MAC) with state noncausally known at one encoder. Two scenarios are considered: 1) each user wishes to communicate an independent message to the common receiver; and 2) the two encoders send a common message to the receiver and the non-cognitive encoder (i.e., the encoder that does not know the state) sends an independ... 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