# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 50

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

Publication Year: 2018, Page(s): C2
| PDF (110 KB)
• ### Expected Value Minimization in Information Theoretic Multiple Priors Models

Publication Year: 2018, Page(s):3957 - 3974
| | PDF (564 KB) | HTML

• ### Generalized Line Spectral Estimation via Convex Optimization

Publication Year: 2018, Page(s):4001 - 4023
| | PDF (615 KB) | HTML

Line spectral estimation is the problem of recovering the frequencies and amplitudes of a mixture of a few sinusoids from equispaced samples. However, in a variety of signal processing problems arising in imaging, radar, and localization, we do not have access directly to such equispaced samples. Rather, we only observe a severely undersampled version of these observations through... View full abstract»

• ### Bridging AIC and BIC: A New Criterion for Autoregression

Publication Year: 2018, Page(s):4024 - 4043
Cited by:  Papers (1)
| | PDF (1450 KB) | HTML

To address order selection for an autoregressive model fitted to time series data, we propose a new information criterion. It has the benefits of the two well-known model selection techniques: the Akaike information criterion and the Bayesian information criterion. When the data are generated from a finite-order autoregression, the Bayesian information criterion is known to be consistent, and so i... View full abstract»

• ### Weighted Matrix Completion and Recovery With Prior Subspace Information

Publication Year: 2018, Page(s):4044 - 4071
| | PDF (1196 KB) | HTML

An incoherent low-rank matrix can be efficiently reconstructed after observing a few of its entries at random, and then, solving a convex program that minimizes the nuclear norm. In many applications, in addition to these entries, potentially valuable prior knowledge about the column and row spaces of the matrix is also available to the practitioner. In this paper, we incorporate ... View full abstract»

• ### Learning Graphical Models From the Glauber Dynamics

Publication Year: 2018, Page(s):4072 - 4080
| | PDF (236 KB) | HTML

In this paper, we consider the problem of learning undirected graphical models from data generated according to the Glauber dynamics (also known as the Gibbs sampler). The Glauber dynamics is a Markov chain that sequentially updates individual nodes (variables) in a graphical model and it is frequently used to sample from the stationary distribution (to which it converges given sufficient time). A... View full abstract»

• ### Noisy Subspace Clustering via Matching Pursuits

Publication Year: 2018, Page(s):4081 - 4104
| | PDF (1102 KB) | HTML

Sparsity-based subspace clustering algorithms have attracted significant attention thanks to their excellent performance in practical applications. A prominent example is the sparse subspace clustering (SSC) algorithm by Elhamifar and Vidal, which performs spectral clustering based on an adjacency matrix obtained by sparsely representing each data point in terms of all the other data points via th... View full abstract»

• ### Correlation Clustering and Biclustering With Locally Bounded Errors

Publication Year: 2018, Page(s):4105 - 4119
| | PDF (402 KB) | HTML

We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with + or −, we wish to partition the graph into clusters while trying to avoid errors: + edges between clusters or − edges within clusters. Classically, o... View full abstract»

• ### Near-Optimal Sample Compression for Nearest Neighbors

Publication Year: 2018, Page(s):4120 - 4128
| | PDF (975 KB) | HTML

We present the first sample compression algorithm for nearest neighbors with non-trivial performance guarantees. We complement these guarantees by demonstrating almost matching hardness lower bounds, which show that our performance bound is nearly optimal. Our result yields new insight into margin-based nearest neighbor classification in metric spaces and allows us to significantly sharpen and sim... View full abstract»

• ### Sharp Time–Data Tradeoffs for Linear Inverse Problems

Publication Year: 2018, Page(s):4129 - 4158
| | PDF (3530 KB) | HTML

In this paper, we characterize sharp time–data tradeoffs for optimization problems used for solving linear inverse problems. We focus on the minimization of a least-squares objective subject to a constraint defined as the sub-level set of a penalty function. We present a unified convergence analysis of the gradient projection algorithm applied to such problems. We sharply characterize the c... View full abstract»

• ### On the Trade-Off Between Bit Depth and Number of Samples for a Basic Approach to Structured Signal Recovery From $b$ -Bit Quantized Linear Measurements

Publication Year: 2018, Page(s):4159 - 4178
| | PDF (1248 KB) | HTML

We consider the problem of recovering a high-dimensional structured signal from independent Gaussian linear measurements each of which is quantized to $b$ bits. The focus is on a specific method of signal recovery that extends a procedure originally proposed by Plan and Vershynin for one-bit quantization to a multi-bit settin... View full abstract»

• ### How to Share a Secret, Infinitely

Publication Year: 2018, Page(s):4179 - 4190
| | PDF (690 KB) | HTML

Secret sharing schemes allow a dealer to distribute a secret piece of information among several parties such that only qualified subsets of parties can reconstruct the secret. The collection of qualified subsets is called an access structure. The best known example is the $k$ -threshold access structure, where... View full abstract»

• ### Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes

Publication Year: 2018, Page(s):4191 - 4206
| | PDF (528 KB) | HTML

Secret-sharing schemes with optimal and universal communication overheads have been obtained independently by Bitar et al. and Huang et al. However, their constructions require a finite field of size $q > n$ , where $n$ View full abstract»

• ### On the Power of Hybrid Networks in Multi-Party Computation

Publication Year: 2018, Page(s):4207 - 4227
| | PDF (3243 KB) | HTML

Perfectly-secure verifiable secret sharing (VSS) and multi-party computation (MPC) protocols in asynchronous network tolerate only at most one-fourth of corruption, while their counterparts in synchronous network sustain against at most one-third corruption. Moreover property-wise, synchronous protocols provide much stronger guarantees than the asynchronous counterparts. Taking note of the fact th... View full abstract»

• ### On the Expansion Complexity of Sequences Over Finite Fields

Publication Year: 2018, Page(s):4228 - 4232
| | PDF (192 KB) | HTML

In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irreducible-expansion complexity which is more suitable for certain applications. We analyze both, the classical and the modified expansion complexity. Moreover, we also study the expansion complexity of the explicit inversive... View full abstract»

• ### STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement

Publication Year: 2018, Page(s):4233 - 4258
| | PDF (3175 KB) | HTML

We present STeP-archives, a novel and practical data archival architecture, where an attacker who wants to censor or tamper with a data object must cause obvious collateral damage to a large number of other objects in the system. We use maximum distance separable erasure codes to entangle unrelated data blocks and provide redundancy against storage failures, which results in an archive with consta... View full abstract»

• ### Two-Way Interference Channel Capacity: How to Have the Cake and Eat It Too

Publication Year: 2018, Page(s):4259 - 4281
| | PDF (2208 KB) | HTML

Two-way communication is prevalent and its fundamental limits are first studied in the point-to-point setting by Shannon. One natural extension is a two-way interference channel (IC) with four independent messages: two associated with each direction of communication. In this paper, we explore a deterministic two-way IC, which captures the key properties of the wireless Gaussian channel. Our main c... View full abstract»

• ### Can Negligible Rate Increase Network Reliability?

Publication Year: 2018, Page(s):4282 - 4293
| | PDF (422 KB) | HTML

In network cooperation strategies, nodes work together with the aim of increasing transmission rates or reliability. This paper demonstrates that enabling cooperation between the transmitters of a two-user multiple access channel via a cooperation facilitator that has access to both messages results in a network whose maximal- and average-error capacity regions are the same; this benefit ensues ev... View full abstract»

• ### On Random-Coding Union Bounds With and Without Erasures

Publication Year: 2018, Page(s):4294 - 4308
| | PDF (718 KB) | HTML

Upper bounds on the error probability of channel coding are derived for codebooks drawn from random codebook ensembles with various independence and symmetry assumptions. For regular decoding (without an erasure option), the random coding union bound of Polyanskiy et al. is improved by carefully taking ties (equal likelihood scores) into account. It is shown that the improved boun... View full abstract»

• ### Optimal Compression for Two-Field Entries in Fixed-Width Memories

Publication Year: 2018, Page(s):4309 - 4322
| | PDF (1076 KB) | HTML

Data compression is a well-studied (and well-solved) problem in the setup of long coding blocks. But important emerging applications need to compress data to memory words of small fixed widths. This new setup is the subject of this paper. In the problem we consider, we have two sources with known discrete distributions, and we wish to find codes that maximize the success probability that the two s... View full abstract»

• ### Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures

Publication Year: 2018, Page(s):4323 - 4346
| | PDF (1026 KB) | HTML

This paper provides upper and lower bounds on the optimal guessing moments of a random variable taking values on a finite set when side information may be available. These moments quantify the number of guesses required for correctly identifying the unknown object and, similarly to Arikan’s bounds, they are expressed in terms of the Arimoto-Rényi conditional entropy. Although Arikan&... View full abstract»

• ### Coded Caching and Content Delivery With Heterogeneous Distortion Requirements

Publication Year: 2018, Page(s):4347 - 4364
| | PDF (1104 KB) | HTML

Cache-aided coded content delivery is studied for devices with diverse quality-of-service requirements, specified by a different average distortion target. The network consists of a server holding a database of independent contents, and users equipped with local caches of different capacities. User caches are filled by the server during a low traffic period without the knowledge of particular user... View full abstract»

• ### Multiplexed Coding for Multiple Streams With Different Decoding Delays

Publication Year: 2018, Page(s):4365 - 4378
| | PDF (927 KB) | HTML

We consider a communication setup where two source streams with different decoding deadlines, must be simultaneously transmitted over a single channel subjected to burst erasures. The encoder multiplexes the two source streams into a single stream of channel-packets. The decoder must recover the two source streams sequentially by their corresponding deadlines. One of the streams, the urgent stream... 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