Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 38

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

Publication Year: 2017, Page(s): C2
| PDF (169 KB)
• ### Information Without Rolling Dice

Publication Year: 2017, Page(s):1349 - 1363
Cited by:  Papers (2)
| | PDF (598 KB) | HTML

The deterministic notions of capacity and entropy are studied in the context of communication and storage of information using square-integrable and bandlimited signals subject to perturbation. The (E, δ)-capacity that extends the Kolmogorov E-capacity to packing sets of overlap at most δ is introduced and compared with the Shannon capacity. The functional form of the results indicat... View full abstract»

• ### Capacity of Remotely Powered Communication

Publication Year: 2017, Page(s):1364 - 1391
| | PDF (1521 KB) | HTML

Motivated by the recent developments in wireless power transfer, we study communication with a remotely powered transmitter. We propose an information-theoretic model where a charger can dynamically decide on how much power to transfer to the transmitter based on its side information regarding the communication, while the transmitter needs to dynamically adapt its coding strategy to its instantane... View full abstract»

• ### A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels

Publication Year: 2017, Page(s):1392 - 1409
Cited by:  Papers (1)
| | PDF (834 KB) | HTML

An upper bound on the feedback capacity of unifilar finite-state channels (FSCs) is derived. A new technique, called the Q-context mapping, is based on a construction of a directed graph that is used for a sequential quantization of the receiver's output sequences to a finite set of contexts. For any choice of Q-graph, the feedback capacity is bounded by a single-letter expression, Cfb ... View full abstract»

• ### Channel Upgradation for Non-Binary Input Alphabets and MACs

Publication Year: 2017, Page(s):1410 - 1424
Cited by:  Papers (1)
| | PDF (776 KB) | HTML

Consider a single-user or multiple-access channel with a large output alphabet. A method to approximate the channel by an upgraded version having a smaller output alphabet is presented and analyzed. The original channel is not necessarily symmetric and does not necessarily have a binary input alphabet. Also, the input distribution is not necessarily uniform. The approximation method is instrumenta... View full abstract»

• ### The Structure of Dual Schubert Union Codes

Publication Year: 2017, Page(s):1425 - 1433
Cited by:  Papers (1)
| | PDF (213 KB) | HTML

In this paper, we prove that Schubert union codes are Tanner codes constructed from the point-line incidence geometry inherited from the Grassmannian. Our proof is based on an iterative encoding algorithm for Tanner codes. This encoder determines the entries of a code word of a Tanner code from the entries in a given subset of its positions. As a result, we find sufficient conditions on the initia... View full abstract»

• ### New MDS Self-Dual Codes From Generalized Reed—Solomon Codes

Publication Year: 2017, Page(s):1434 - 1438
| | PDF (229 KB) | HTML

Both Maximum Distance Separable and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining the existence of q-ary MDS self-dual codes for various lengths has been investigated extensively. The problem is completely solved for the case where q is even. This paper focuses on ... View full abstract»

• ### Edge Coloring and Stopping Sets Analysis in Product Codes With MDS Components

Publication Year: 2017, Page(s):1439 - 1462
| | PDF (1532 KB) | HTML

We consider non-binary product codes with MDS components and their iterative row-column algebraic decoding on the erasure channel. Both independent and block erasures are considered in this paper. A compact graph representation is introduced on which we define double-diversity edge colorings via the rootcheck concept. An upper bound of the number of decoding iterations is given as a function of th... View full abstract»

• ### Weight Distributions of Non-Binary Multi-Edge Type LDPC Code Ensembles: Analysis and Efficient Evaluation

Publication Year: 2017, Page(s):1463 - 1475
| | PDF (1322 KB) | HTML

Non-binary multi-edge type ensembles of low-density parity-check codes are analyzed in terms of non-binary codeword weight distribution and its growth rate. In particular, an exact expression of the growth rate for small weights is developed. As a side result, the stopping set distributions of these ensembles are developed. Examples of weight distributions are provided, showing that the derived cl... View full abstract»

• ### Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding

Publication Year: 2017, Page(s):1476 - 1500
Cited by:  Papers (2)
| | PDF (727 KB) | HTML

Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the additive white Gaussian noise (AWGN) channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords are sparse linear combinations of columns of the matrix. In this paper, we propose an approximate message passing decoder for s... View full abstract»

• ### On the Construction of Polar Codes for Channels With Moderate Input Alphabet Sizes

Publication Year: 2017, Page(s):1501 - 1509
Cited by:  Papers (1)
| | PDF (222 KB) | HTML

Current deterministic algorithms for the construction of polar codes can only be argued to be practical for channels with small input alphabet sizes. In this paper, we show that any construction algorithm for channels with moderate input alphabet size, which follows the paradigm of “degrading after each polarization step,” will inherently be impractical with respect to a certain ... View full abstract»

• ### On Secrecy Capacity of Minimum Storage Regenerating Codes

Publication Year: 2017, Page(s):1510 - 1524
| | PDF (447 KB) | HTML

In this paper, we revisit the problem of characterizing the secrecy capacity of minimum storage regenerating (MSR) codes under the passive (l1, l2)-eavesdropper model, where the eavesdropper has access to data stored on l1 nodes and the repair data for an additional l2 nodes. We study it from the informationtheoretic perspective. First, some general prop... View full abstract»

• ### Nonadaptive Group Testing Based on Sparse Pooling Graphs

Publication Year: 2017, Page(s):1525 - 1534
| | PDF (481 KB) | HTML

An information theoretical analysis of nonadaptive group testing schemes based on sparse pooling graphs is presented. A pooling graph is a bipartite graph for which the adjacency matrix is a pooling matrix. The binary status of the objects to be tested are modeled by independent identically distributed. Bernoulli random variables with probability p. An (l, r, n)regular pooling graph is a bipartite... View full abstract»

• ### Adaptive Compressed Sensing for Support Recovery of Structured Sparse Sets

Publication Year: 2017, Page(s):1535 - 1554
| | PDF (583 KB) | HTML

This paper investigates the problem of recovering the support of structured signals via adaptive compressive sensing. We examine several classes of structured support sets, and characterize the fundamental limits of accurately recovering such sets through compressive measurements, while simultaneously providing adaptive support recovery protocols that perform near optimally for these classes. We s... View full abstract»

• ### Quantitative Recovery Conditions for Tree-Based Compressed Sensing

Publication Year: 2017, Page(s):1555 - 1571
Cited by:  Papers (1)
| | PDF (772 KB) | HTML

As shown by Blumensath and Davies (2009) and Baraniuk et al. (2010), signals whose wavelet coefficients exhibit a rooted tree structure can be recovered using specially adapted compressed sensing algorithms from just n = O(k) measurements, where k is the sparsity of the signal. Motivated by these results, we introduce a simplified proportional-dimensional asymptotic framework, which enables the qu... View full abstract»

• ### On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors

Publication Year: 2017, Page(s):1572 - 1579
| | PDF (222 KB) | HTML

We consider the following detection problem: given a realization of a symmetric matrix X of dimension n, distinguish between the hypothesis that all upper triangular variables are independent and identically distributed (i.i.d). Gaussians variables with mean 0 and variance 1 and the hypothesis, where X is the sum of such matrix and an independent rank-one perturbation. This setup applies to the si... View full abstract»

• ### Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation

Publication Year: 2017, Page(s):1580 - 1600
| | PDF (709 KB) | HTML

We derive lower bounds on the Bayes risk in decentralized estimation, where the estimator does not have direct access to the random samples generated conditionally on the random parameter of interest, but only to the data received from local processors that observe the samples. The received data are subject to communication constraints due to the quantization and the noisy communication channels f... View full abstract»

• ### High-Dimensional Estimation of Structured Signals From Non-Linear Observations With General Convex Loss Functions

Publication Year: 2017, Page(s):1601 - 1619
Cited by:  Papers (1)
| | PDF (519 KB) | HTML

We study the issue of estimating a structured signal x0 ∈ ℝn from non-linear and noisy Gaussian observations. Supposing that x0 is contained in a certain convex subset K ⊂ Rn, we prove that accurate recovery is already feasible if the number of observations exceeds the effective dimension of K. It will turn out that the possibly unknown non-linearity of o... View full abstract»

• ### Nonparametric Regression Based on Hierarchical Interaction Models

Publication Year: 2017, Page(s):1620 - 1630
Cited by:  Papers (1)
| | PDF (231 KB) | HTML

In this paper, we introduce the so-called hierarchical interaction models, where we assume that the computation of the value of a function m : ℝd → ℝ is done in several layers, where in each layer a function of at most d* inputs computed by the previous layer is evaluated. We investigate two different regression estimates based on polynomial splines and on neural ne... View full abstract»

• ### Delay on Broadcast Erasure Channels Under Random Linear Combinations

Publication Year: 2017, Page(s):1631 - 1661
| | PDF (1899 KB) | HTML

We consider a transmitter broadcasting random linear combinations (over a field of size d) formed from a block of c packets to a collection of n receivers, where the channels between the transmitter and each receiver are independent erasure channels with reception probabilities q = (q1,..., qn). We establish several properties of the random delay until all n receivers have re... View full abstract»

• ### Wireless Multihop Device-to-Device Caching Networks

Publication Year: 2017, Page(s):1662 - 1676
Cited by:  Papers (1)
| | PDF (592 KB) | HTML

We consider a wireless device-to-device network, where n nodes are uniformly distributed at random over the network area. We let each node caches M files from a library of size m ≥ M. Each node in the network requests a file from the library independently at random, according to a popularity distribution, and is served by other nodes having the requested file in their local cache via (possi... View full abstract»

• ### $k$ -Connectivity in Random $K$ -Out Graphs Intersecting Erdős-Rényi Graphs

Publication Year: 2017, Page(s):1677 - 1692
Cited by:  Papers (3)
| | PDF (519 KB) | HTML

We investigate k-connectivity in secure wireless sensor networks under the random pairwise key predistribution scheme with unreliable links. When wireless communication links are modeled as independent on-off channels, this amounts to analyzing a random graph model formed by intersecting a random K-out graph and an Erdös-Rényi graph. We present conditions on how to scale the parame... View full abstract»

• ### A New Framework for the Performance Analysis of Wireless Communications Under Hoyt (Nakagami- $q$ ) Fading

Publication Year: 2017, Page(s):1693 - 1702
Cited by:  Papers (1)
| | PDF (547 KB) | HTML

We present a novel relationship between the distribution of circular and non-circular complex Gaussian random variables. Specifically, we show that the distribution of the squared norm of a non-circular complex Gaussian random variable, usually referred to as the squared Hoyt distribution, can be constructed from a conditional exponential distribution. From this fundamental connection we introduce... View full abstract»

• ### Diversity-Multiplexing Trade-Off of Half-Duplex Single Relay Networks

Publication Year: 2017, Page(s):1703 - 1720
| | PDF (964 KB) | HTML

The diversity-multiplexing trade-off (DMT) of half-duplex single-relay networks is computed analytically, where all the channels in the networks are assumed to be quasi-static flat-fading channels with independent Rayleigh distributions. We have computed DMT of dynamic quantize-map-and-forward (DQMF) strategy analytically, which has the optimal DMT for half-duplex single-relay networks with local ... 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