# IEEE Transactions on Information Theory

## Volume 63 Issue 8 • Aug. 2017

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 47

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

Publication Year: 2017, Page(s): C2
| PDF (111 KB)
• ### Exact Expression For Information Distance

Publication Year: 2017, Page(s):4725 - 4728
| | PDF (139 KB) | HTML

Information distance can be defined not only between two strings but also in a finite multiset of strings of cardinality greater than two. We determine a best upper bound on the information distance. It is exact, since the upper bound on the information distance for all multisets is the same as the lower bound for infinitely many multisets of each of infinitely many cardinalities, up to a constant... View full abstract»

• ### Information Limits for Recovering a Hidden Community

Publication Year: 2017, Page(s):4729 - 4745
Cited by:  Papers (1)
| | PDF (337 KB) | HTML

We study the problem of recovering a hidden community of cardinality K from an n × n symmetric data matrix A, where for distinct indices i, j, Aij~ P if i, j both belong to the community and Aij~ Q otherwise, for two known probability distributions P and Q depending on n. If P = Bern(p) and Q = Bern(q) with p q, it reduces to the problem of finding a densely connected K-subgr... View full abstract»

• ### Hammerstein System Identification With the Nearest Neighbor Algorithm

Publication Year: 2017, Page(s):4746 - 4757
| | PDF (580 KB) | HTML

The nonlinear characteristic in a Hammerstein system, i.e., a system in which a nonlinear memoryless subsystem and a linear dynamic are connected in a cascade, is recovered with the nonparametric nearest neighbor regression estimate. The a priori information is nonparametric, both the nonlinear characteristic and the impulse response are completely unknown and can be of any form. Local and global ... View full abstract»

• ### Consistent Estimation of the Filtering and Marginal Smoothing Distributions in Nonparametric Hidden Markov Models

Publication Year: 2017, Page(s):4758 - 4777
| | PDF (679 KB) | HTML

In this paper, we consider the filtering and smoothing recursions in nonparametric finite state space hidden Markov models (HMMs) when the parameters of the model are unknown and replaced by estimators. We provide an explicit and time uniform control of the filtering and smoothing errors in total variation norm as a function of the parameter estimation errors. We prove that the risk for the filter... View full abstract»

• ### Neural Dissimilarity Indices That Predict Oddball Detection in Behaviour

Publication Year: 2017, Page(s):4778 - 4796
| | PDF (1227 KB) | HTML

Neuroscientists have recently shown that images that are difficult to find in visual search elicit similar patterns of firing across a population of recorded neurons. The L<sup>1</sup> distance between firing rate vectors associated with two images was strongly correlated with the inverse of decision time in behavior. But why should decision times be correlated with L<sup>1</s... View full abstract»

• ### Recursive Distributed Detection for Composite Hypothesis Testing: Nonlinear Observation Models in Additive Gaussian Noise

Publication Year: 2017, Page(s):4797 - 4828
Cited by:  Papers (5)
| | PDF (1037 KB) | HTML

This paper studies recursive composite hypothesis testing in a network of sparsely connected agents. The network objective is to test a simple null hypothesis against a composite alternative concerning the state of the field, modeled as a vector of (continuous) unknown parameters determining the parametric family of probability measures induced on the agents' observation spaces under the hypothese... View full abstract»

• ### On Locally Dyadic Stationary Processes

Publication Year: 2017, Page(s):4829 - 4837
| | PDF (623 KB) | HTML

We introduce the concept of local dyadic stationarity, to account for nonstationary time series, within the framework of Walsh-Fourier analysis. We define and study time-varying, dyadic, autoregressive, moving average (tvDARMA) models. It is proven that the general tvDARMA process can be approximated locally by either a time-varying dyadic moving average and a time-varying dyadic autoregressive pr... View full abstract»

• ### Efficient Regression in Metric Spaces via Approximate Lipschitz Extension

Publication Year: 2017, Page(s):4838 - 4849
Cited by:  Papers (1)
| | PDF (262 KB) | HTML

We present a framework for performing efficient regression in general metric spaces. Roughly speaking, our regressor predicts the value at a new point by computing an approximate Lipschitz extension- the smoothest function consistent with the observed data- after performing structural risk minimization to avoid overfitting. We obtain finite-sample risk bounds with minimal structural and noise assu... View full abstract»

• ### Compressed Sensing With Combinatorial Designs: Theory and Simulations

Publication Year: 2017, Page(s):4850 - 4859
| | PDF (586 KB) | HTML

We use deterministic and probabilistic methods to analyze the performance of compressed sensing matrices constructed from Hadamard matrices and pairwise balanced designs, previously introduced by a subset of the authors. In this paper, we obtain upper and lower bounds on the sparsity of signals for which our matrices guarantee recovery. These bounds are tight to within a multiplicative factor of a... View full abstract»

• ### Compressed Sensing and Parallel Acquisition

Publication Year: 2017, Page(s):4860 - 4882
Cited by:  Papers (3)
| | PDF (733 KB) | HTML

Parallel acquisition systems arise in various applications to moderate problems caused by insufficient measurements in single-sensor systems. These systems allow simultaneous data acquisition in multiple sensors, thus alleviating such problems by providing more overall measurements. In this paper, we consider the combination of compressed sensing with parallel acquisition. We establish the theoret... View full abstract»

• ### $\mathbb {Z}_{2}\mathbb {Z}_{2}[u]$ –Cyclic and Constacyclic Codes

Publication Year: 2017, Page(s):4883 - 4893
| | PDF (400 KB) | HTML

Following the very recent studies on ℤ2ℤ4-additive codes, ℤ2ℤ2[u]-linear codes have been introduced by Aydogdu et al. In this paper, we introduce and study the algebraic structure of cyclic, constacyclic codes and their duals over the R-module Z2αRβwhere R = ℤ2+uℤ2= {0, 1, u, u + 1} is the ring with ... View full abstract»

• ### Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes

Publication Year: 2017, Page(s):4894 - 4927
Cited by:  Papers (7)
| | PDF (2644 KB) | HTML

We study the approximate message-passing decoder for sparse superposition coding on the additive white Gaussian noise channel and extend our preliminary work. We use heuristic statistical-physics-based tools, such as the cavity and the replica methods, for the statistical analysis of the scheme. While superposition codes asymptotically reach the Shannon capacity, we show that our iterative decoder... View full abstract»

• ### Locally Recoverable Codes on Algebraic Curves

Publication Year: 2017, Page(s):4928 - 4939
Cited by:  Papers (2)
| | PDF (527 KB) | HTML

A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the encoding is a function of a small number (at most r) of other symbols of the codeword. In this paper, we introduce a construction of LRC codes on algebraic curves, extending a recent construction of the Reed-Solomon like codes with locality. We treat the following situations: local recovery of a single er... View full abstract»

• ### Deep Holes and MDS Extensions of Reed–Solomon Codes

Publication Year: 2017, Page(s):4940 - 4948
| | PDF (211 KB) | HTML

We study the problem of classifying deep holes of Reed-Solomon codes. We show that this problem is equivalent to the problem of classifying maximum distance separable (MDS) extensions of Reed-Solomon codes by one digit. This equivalence allows us to improve recent results on the former problem. In particular, we classify deep holes of Reed-Solomon codes of dimension greater than half the alphabet ... View full abstract»

• ### Complex Linear Physical-Layer Network Coding

Publication Year: 2017, Page(s):4949 - 4981
Cited by:  Papers (2)
| | PDF (2208 KB) | HTML

This paper presents the results of a comprehensive investigation of complex linear physicallayer network coding (PNC) in two-way relay channels. In this system, two nodes A and B communicate with each other via a relay R. Nodes A and B send complex symbols, wA and wB, simultaneously to relay R. Based on the simultaneously received signals, relay R computes a linear combination of the symbols, w View full abstract»

• ### Asymmetric Lee Distance Codes for DNA-Based Storage

Publication Year: 2017, Page(s):4982 - 4995
Cited by:  Papers (4)
| | PDF (1047 KB) | HTML

We introduce a new family of codes, termed asymmetric Lee distance (ALD) codes, designed to correct errors arising in DNA-based storage systems and systems with parallel string transmission protocols. ALD codes are defined over a quaternary alphabet and analyzed in this particular setting, but the derived results hold for other alphabet sizes as well. Our technical contributions are twofold. First... View full abstract»

• ### Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms

Publication Year: 2017, Page(s):4996 - 5010
Cited by:  Papers (6)
| | PDF (629 KB) | HTML

The ability to store data in the DNA of a living organism has applications in a variety of areas including synthetic biology and watermarking of patented genetically modified organisms. Data stored in this medium are subject to errors arising from various mutations, such as point mutations, indels, and tandem duplication, which need to be corrected to maintain data integrity. In this paper, we pro... View full abstract»

• ### Principal Inertia Components and Applications

Publication Year: 2017, Page(s):5011 - 5038
Cited by:  Papers (1)
| | PDF (1279 KB) | HTML

We explore properties and applications of the principal inertia components (PICs) between two discrete random variables X and Y. The PICs lie in the intersection of information and estimation theory, and provide a fine-grained decomposition of the dependence between X and Y. Moreover, the PICs describe which functions of X can or cannot be reliably inferred (in terms of MMSE), given an observation... View full abstract»

• ### The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds

Publication Year: 2017, Page(s):5039 - 5051
Cited by:  Papers (4)
| | PDF (368 KB) | HTML

The likelihood decoder is a stochastic decoder that selects the decoded message at random, using the posterior distribution of the true underlying message given the channel output. In this paper, we study a generalized version of this decoder, where the posterior is proportional to a general function that depends only on the joint empirical distribution of the output vector and the code word. This... View full abstract»

• ### Feedback and Partial Message Side-Information on the Semideterministic Broadcast Channel

Publication Year: 2017, Page(s):5052 - 5073
| | PDF (702 KB) | HTML

The capacity of the semideterministic discrete memoryless broadcast channel (SD-BC) with partial message side-information (P-MSI) at the receivers is established. In the setting without a common message, it is shown that P-MSI to the stochastic receiver alone can increase capacity, whereas P-MSI to the deterministic receiver can only increase capacity if also the stochastic receiver has P-MSI. The... View full abstract»

• ### Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes

Publication Year: 2017, Page(s):5074 - 5086
Cited by:  Papers (5)
| | PDF (1062 KB) | HTML

Binary almost instantaneous fixed-to-variable length (AIFV) codes are lossless codes that generalize the class of instantaneous fixed-to-variable length codes. The code uses two code trees and assigns source symbols to incomplete internal nodes as well as to leaves. AIFV codes are empirically shown to attain better compression ratio than Huffman codes. Nevertheless, an upper bound on the redundanc... View full abstract»

• ### Joint Empirical Coordination of Source and Channel

Publication Year: 2017, Page(s):5087 - 5114
| | PDF (1411 KB) | HTML

In a decentralized and self-configuring network, the communication devices are considered as autonomous decision makers that sense their environment and that implement optimal transmission schemes. It is essential that these autonomous devices cooperate and coordinate their actions, to ensure the reliability of the transmissions and the stability of the network. We study a point-to-point scenario ... View full abstract»

• ### Capacity Bounds for Additive Symmetric $\alpha$ -Stable Noise Channels

Publication Year: 2017, Page(s):5115 - 5123
Cited by:  Papers (3)
| | PDF (506 KB) | HTML

Impulsive noise features in many modern communication systems-ranging from wireless to molecular-and is often modeled by the α-stable distribution. At present, the capacity of α-stable noise channels is not well understood, with the exception of Cauchy noise (α = 1) with a logarithmic constraint and Gaussian noise (α = 2) with a power constraint. In this paper, we consider additive symmetric α-sta... 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