IEEE Transactions on Information Theory

Issue 6 • June 2017

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.

Filter Results

Displaying Results 1 - 25 of 45
  • Table of contents

    Publication Year: 2017, Page(s):C1 - C4
    Request permission for commercial reuse | PDF file iconPDF (149 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2017, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Invariancy of Sparse Recovery Algorithms

    Publication Year: 2017, Page(s):3333 - 3347
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (721 KB) | HTML iconHTML

    In this paper, a property for sparse recovery algorithms, called invariancy, is introduced. The significance of invariancy is that the performance of the algorithms with this property is less affected when the sensing (i.e., the dictionary) is ill-conditioned. This is because for this kind of algorithms, there exists implicitly an equivalent well-conditioned problem, which is being solved. Some ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Minimax Capacity Loss Under Sub-Nyquist Universal Sampling

    Publication Year: 2017, Page(s):3348 - 3367
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1130 KB) | HTML iconHTML

    This paper investigates the information rate loss in analog channels, when the sampler is designed to operate independent of the instantaneous channel occupancy. Specifically, a multiband linear time-invariant Gaussian channel under universal sub-Nyquist sampling is considered. The entire channel bandwidth is divided into n subbands of equal bandwidth. At each time, only k constant-gain subbands a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals

    Publication Year: 2017, Page(s):3368 - 3385
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1038 KB) | HTML iconHTML

    Binary measurements arise naturally in a variety of statistics and engineering applications. They may be inherent to the problem-for example, in determining the relationship between genetics and the presence or absence of a disease-or they may be a result of extreme quantization. A recent influx of literature has suggested that using prior signal information can greatly improve the ability to reco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-Coherence Frames From Group Fourier Matrices

    Publication Year: 2017, Page(s):3386 - 3404
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (973 KB) | HTML iconHTML

    Many problems in areas such as compressive sensing and coding theory seek to design a set of equal-norm vectors with large angular separation. This idea is essentially equivalent to constructing a frame with low coherence. The elements of such frames can in turn be used to build high-performance spherical codes, quantum measurement operators, and compressive sensing measurement matrices, to name a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized Sequential Composite Hypothesis Test Based on One-Bit Communication

    Publication Year: 2017, Page(s):3405 - 3424
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1100 KB) | HTML iconHTML

    This paper considers the sequential composite hypothesis test with multiple sensors. The sensors observe random samples in parallel and communicate with a fusion center, who makes the global decision based on the sensor inputs. On the one hand, in the centralized scenario, where local samples are precisely transmitted to the fusion center, the generalized sequential likelihood ratio test (GSPRT) i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditions for Existence of Uniformly Consistent Classifiers

    Publication Year: 2017, Page(s):3425 - 3432
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    We consider the statistical problem of binary classification, which means attaching a random observation X from a separable metric space E to one of the two classes, 0 or 1. We prove that the consistent estimation of conditional probability p(X) = P(Y = 1 | X), where Y is the true class of X, is equivalent to the consistency of a class of empirical classifiers. We then investigate for what classes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Asymptotic Optimality in Sequential Changepoint Detection: Non-iid Case

    Publication Year: 2017, Page(s):3433 - 3450
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    We consider a sequential Bayesian changepoint detection problem for a general stochastic model, assuming that the observed data may be dependent and non-identically distributed and the prior distribution of the change point is arbitrary, not necessarily geometric. Tartakovsky and Veeravalli (2005) developed a general asymptotic theory of changepoint detection in the case of non-identically distrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Detection of Correlated Signals in Low-Rank-Plus-Noise Type Data Sets Using Informative Canonical Correlation Analysis (ICCA)

    Publication Year: 2017, Page(s):3451 - 3467
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1412 KB) | HTML iconHTML Multimedia Media

    We consider two matrix-valued data sets that are modeled as low-rank-correlated-signal-plus-Gaussian noise. When empirical canonical correlation analysis (CCA) is used to infer these latent correlations, there is a broad regime, where this inference will fail, which was classified by Bao and collaborators in the limit of high dimensionality and sample size. This regime includes the setting, previo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information-Theoretic Analysis of Haplotype Assembly

    Publication Year: 2017, Page(s):3468 - 3479
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (823 KB) | HTML iconHTML

    This paper studies the haplotype assembly problem from an information-theoretic perspective. In the human genome, a haplotype is a sequence of nucleotide bases on a chromosome that differ from the bases in the corresponding positions on the other chromosome in a homologous pair. Haplotype sequences can conveniently be represented by binary strings, which enable us to transform the bioinformatics p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification via the Broadcast Channel

    Publication Year: 2017, Page(s):3480 - 3501
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (446 KB) | HTML iconHTML Multimedia Media

    The identification (ID) capacity region of the two-receiver broadcast channel (BC) is shown to be the set of rate-pairs for which, for some distribution on the channel input, each receiver's ID rate does not exceed the mutual information between the channel input and the channel output that it observes. Moreover, the capacity region's interior is achieved by codes with deterministic encoders. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Source-Channel Coding With Feedback

    Publication Year: 2017, Page(s):3502 - 3515
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB) | HTML iconHTML

    This paper quantifies the fundamental limits of variable-length transmission of a general (possibly analog) source over a memoryless channel with noiseless feedback, under a distortion constraint. We consider excess distortion, average distortion, and guaranteed distortion (d-semifaithful codes). In contrast to the asymptotic fundamental limit, a general conclusion is that allowing variable-length... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of Gaussian Many-Access Channels

    Publication Year: 2017, Page(s):3516 - 3539
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (739 KB) | HTML iconHTML

    Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This paper proposes a new paradigm, referred to as many-user information theory, where the number of users is allowed to grow with the blocklength. This paradigm is motivated by emerging systems with a massive number of users in an a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity Bounds for Networks With Correlated Sources and Characterisation of Distributions by Entropies

    Publication Year: 2017, Page(s):3540 - 3553
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (378 KB) | HTML iconHTML

    Characterising the capacity region for a network can be extremely difficult. Even with independent sources, determining the capacity region can be as hard as the open problem of characterising all information inequalities. The majority of computable outer bounds in the literature are relaxations of the linear programming bound, which involves entropy functions of random variables related to the so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Capacity of the Noncausal Relay Channel

    Publication Year: 2017, Page(s):3554 - 3564
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (545 KB) | HTML iconHTML

    This paper studies the noncausal relay channel, also known as the relay channel with unlimited look ahead, introduced by by El Gamal, Hassanpour, and Mammen. Unlike the standard relay channel model, where the relay encodes its signal based on the previous received output symbols, the relay in the noncausal relay channel encodes its signal as a function of the entire received sequence. In the exist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary Fading Interference Channel With No CSIT

    Publication Year: 2017, Page(s):3565 - 3578
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5156 KB) | HTML iconHTML

    We study the capacity region of the two-user binary fading (or erasure) interference channel, where the transmitters have no knowledge of the channel state information. We develop new inner bounds and outer bounds for this problem. We identify three regimes based on the channel parameters: weak, moderate, and strong interference regimes. Interestingly, this is similar to the generalized degrees of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relations Between Information and Estimation in Discrete-Time Lévy Channels

    Publication Year: 2017, Page(s):3579 - 3594
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (337 KB) | HTML iconHTML

    Fundamental relations between information and estimation have been established in the literature for the discrete-time Gaussian and Poisson channels. In this paper, we demonstrate that such relations hold for a much larger class of observation models. We introduce the natural family of discrete-time Lévy channels where the distribution of the output conditioned on the input is infinitely d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Yet Another Proof of the Entropy Power Inequality

    Publication Year: 2017, Page(s):3595 - 3599
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (159 KB) | HTML iconHTML

    Yet another simple proof of the entropy power inequality is given, which avoids both the integration over a path of Gaussian perturbation and the use of Young's inequality with sharp constant or Rényi entropies. The proof is based on a simple change of variables, is formally identical in one and several dimensions, and easily settles the equality case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fourier Analysis of MAC Polarization

    Publication Year: 2017, Page(s):3600 - 3620
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (369 KB) | HTML iconHTML

    One problem with multiple access channel (MAC) polar codes that are based on MAC polarization is that they may not achieve the entire capacity region. The reason behind this problem is that MAC polarization sometimes induces a loss in the capacity region. This paper provides a single letter necessary and sufficient condition, which characterizes all the MACs that do not lose any part of their capa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes

    Publication Year: 2017, Page(s):3621 - 3629
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for the MCWCs, which yield several new infinite families of optimal MCWCs. Furthermore, we demonstrate that the Johnson-type upper bounds of the MCWCs are asymptotically tight for fixed Hamming weights an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of Metrics Induced by Hierarchical Posets

    Publication Year: 2017, Page(s):3630 - 3640
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB) | HTML iconHTML

    In this paper, we consider metrics determined by hierarchical posets and give explicit formulas for the main parameters of a linear code: the minimum distance and the packing, covering, and Chebyshev radii of a code. We also present ten characterizations of hierarchical poset metrics, including new characterizations and simple new proofs to the known ones. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Shape of the General Error Locator Polynomial for Cyclic Codes

    Publication Year: 2017, Page(s):3641 - 3657
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1166 KB) | HTML iconHTML

    General error locator polynomials were introduced in 2005 as an alternative decoding for cyclic codes. We now present a conjecture on their sparsity, which would imply polynomial-time decoding for all cyclic codes. A general result on the explicit form of the general error locator polynomial for all cyclic codes is given, along with several results for specific code families, providing evidence to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Subsets of the Normal Rational Curve

    Publication Year: 2017, Page(s):3658 - 3662
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (150 KB) | HTML iconHTML

    A normal rational curve of the (k - 1)-dimensional projective space over Fq is an arc of size q+1, since any k points of the curve span the whole space. In this paper, we will prove that if q is odd, then a subset of size 3k -6 of a normal rational curve cannot be extended to an arc of size q +2. In fact, we prove something slightly stronger. Suppose that q is odd and E is a (2k - 3)-subset of an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PhaseCode: Fast and Efficient Compressive Phase Retrieval Based on Sparse-Graph Codes

    Publication Year: 2017, Page(s):3663 - 3691
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2052 KB) | HTML iconHTML

    We consider the problem of recovering a complex signal x ∈ ℂn from m intensity measurements of the form |aiH x|, 1 ≤ i ≤ m, where aiH is the ith row of measurement matrix A ∈ ℂm×n. Our main focus is on the case where the measurement vectors are unconstrained, and where x is exactly K-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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