IEEE Transactions on Information Theory

Early Access Articles

Early Access articles are made available in advance of the final electronic or print versions. Early Access articles are peer reviewed but may not be fully edited. They are fully citable from the moment they appear in IEEE Xplore.

Filter Results

Displaying Results 1 - 25 of 182
  • Fully Distributed Sequential Hypothesis Testing: Algorithms and Asymptotic Analyses

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (495 KB)

    This work analyzes the asymptotic performances of fully distributed sequential hypothesis testing procedures as the type-I and type-II error rates approach zero, in the context of a sensor network without a fusion center. In particular, the sensor network is defined by an undirected graph, where each sensor can observe samples over time, access the information from the adjacent sensors, and perfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Φ-Entropic Measures of Correlation

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (929 KB)

    A measure of correlation is said to have the tensorization property if it does not change when computed for i.i.d. copies. More precisely, a measure of correlation between two random variables X,Y denoted by ρ(X,Y), has the tensorization property if ρ(Xn,Yn) = ρ(X,Y) where (Xn,Yn) denotes n i.i.d. copies of (X, Y). Two well-known examples of such measures are the maxim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wyner’s Common Information under Rényi Divergence Measures

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (482 KB)

    We study a generalized version of Wyner’s common information problem (also coined the distributed source simulation problem). The original common information problem consists in understanding the minimum rate of the common input to independent processors to generate an approximation of a joint distribution when the distance measure used to quantify the discrepancy between the synthesized an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Storage vs Repair-Bandwidth Trade-off for Clustered Storage Systems

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1066 KB)

    We study a generalization of the setting of regenerating codes, motivated by applications to storage systems consisting of clusters of storage nodes. There are n clusters in total, with m nodes per cluster. A data file is coded and stored across the mn nodes, with each node storing α symbols. For availability of data, we require that the file be retrievable by downloading the entire content... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adversarial Source Identification Game with Corrupted Training

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (584 KB)

    We study a variant of the source identification game with training data in which part of the training data is corrupted by an attacker. In the addressed scenario, the defender aims at deciding whether a test sequence has been drawn according to a discrete memoryless source X ~ PX, whose statistics are known to him through the observation of a training sequence generated by X. In order to un... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coded Caching and Content Delivery with Heterogeneous Distortion Requirements

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (798 KB)

    Cache-aided coded content delivery is studied for devices with diverse quality-of-service (QoS) 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 particula... View full abstract»

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

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (4495 KB)

    During the summers (1951-1954) that I was a graduate student in ''pure mathematics'', I worked in the Systems Engineering Section of the Glenn L. Martin Company. I began to notice the applicability of supposedly pure topics like prime number theory and finite field theory to problems in communications. My first major applied effort involved developing the theory of �... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (402 KB)

    In this paper, we study the cycle distribution of random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes. We prove that for a random bipartite graph, with a given (irregular) degree distribution, the distributions of cycles of different length tend to independent Poisson distributions, as the size of the graph tends t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bayesian Model Averaging with Exponentiated Least Squares Loss

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1618 KB)

    The model averaging problem is to average multiple models to achieve a prediction accuracy not much worse than that of the best single model in terms of mean squared error. It is known that if the models are misspecified, model averaging is superior to model selection. Specifically, let n be the sample size, then the worst case regret of the former decays at a rate of O(1/n) while the worst case r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of KL Divergence: Optimal Minimax Rate

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (715 KB)

    The problem of estimating the Kullback-Leibler divergence D(P‖Q) between two unknown distributions P and Q is studied, under the assumption that the alphabet size k of the distributions can scale to infinity. The estimation is based on m independent samples drawn from P and n independent samples drawn from Q. It is first shown that there does not exist any consistent estimator that guarante... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Encryption from Random Quasi-Cyclic Codes

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1121 KB)

    We propose a framework for constructing efficient code-based encryption schemes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based on the difficulty of decoding random linear codes from random errors of low weight. We depart somewhat from Alekhnovich’s approach and propose an encryption scheme ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effect of Local Decodability Constraints on Variable-Length Compression

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (290 KB)

    We consider a variable-length source coding problem subject to local decodability constraints. In particular, we investigate the blocklength scaling behavior attainable by encodings of r-sparse binary sequences, under the constraint that any source bit can be correctly decoded upon probing at most d codeword bits. We consider both adaptive and nonadaptive access models, and derive upper and lower ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (628 KB)

    We consider the problem of multiple descriptions (MD) source coding and propose new coding strategies involving both unstructured and structured coding layers. Previously, the most general achievable rate-distortion (RD) region for the ldescriptions problem was the Combinatorial Message Sharing with Binning (CMSB) region. The CMSB scheme utilizes unstructured quantizers and unstructured binning. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random Ensembles of Lattices from Generalized Reductions

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (407 KB)

    We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e., with packing density comparable to the Minkowski-Hlawka lower bound). Specializing to number field lattices, we obtain a number of interesting corollaries - for in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Universal Coding Scheme for Remote Generation of Continuous Random Variables

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (255 KB)

    Alice selects an arbitrary pdf f and uses a stochastic encoder to generate a prefix-free codeword M, which is sent to Bob so that he can generate a single instance of the random variable X ~ f. We describe a universal coding scheme for this setup which works for any f, and establish an upper bound on its expected codeword length when the pdf f is bounded, orthogonally concave (which include... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical Properties of Loss Rate Estimators in Tree Topology

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (401 KB)

    A two-segment model is introduced here to model the probing process in a network with the tree topology that subsequently leads to four types of explicit estimators to estimate the loss rates of the links within the network. All of the estimators are derived by the maximum likelihood principle, where one of them is developed from an estimator that was used but neglected previously. The estimators ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (906 KB)

    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»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax Rényi Redundancy

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1157 KB)

    The redundancy for universal lossless compression of discrete memoryless sources in Campbell’s setting is characterized as a minimax Rényi divergence, which is shown to be equal to the maximal α-mutual information via a generalized redundancy-capacity theorem. Special attention is placed on the analysis of the asymptotics of minimax Rényi divergence, which is determined... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information-theoretic Characterization of MIMO Systems with Multiple Rayleigh Scattering

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1265 KB)

    We present an information-theoretic analysis of a point-to-point Multiple-Input-Multiple-Output (MIMO) link affected by Rayleigh fading and multiple scattering, under perfect channel state information at the receiver. Unlike previous work addressing this setting, we investigate the Random Coding Error Exponent, its associated cutoff rate and the Expurgated Error Exponent, and derive closed-form ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Equivalence of Binary Asymmetric Channels regarding the Maximum Likelihood Decoding.

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (427 KB)

    We study the problem of characterizing when two memoryless binary asymmetric channels, described by their transition probabilities (p,q) and (p′,q′), are equivalent from the point of view of maximum likelihood decoding (MLD) when restricted to n-block binary codes. This equivalence of channels induces a partition (depending on n) on the space of parameters (p,q) into regions associat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate (n-1)/n Systematic memory Maximum Distance Separable Convolutional Codes

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (469 KB)

    A systematic convolutional encoder of rate (n–1)/n and maximum memory D generates a code of free distance at most D = D+2 and, at best, a column distance profile (CDP) of [2,3,...,D]. A code is memory Maximum Distance Separable (mMDS) if it possesses this CDP. Applied on a communication channel over which packets are transmitted sequentially and which loses (era... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rigorous Approach to High-Resolution Entropy-Constrained Vector Quantization

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (560 KB)

    The nonnegativity of relative entropy implies that the differential entropy of a random vector X with probability density function (pdf) f is upper-bounded by –E[log g(X)] for any arbitrary pdf g. Using this inequality with a cleverly chosen g, we derive a lower bound on the asymptotic excess rate of entropy-constrained vector quantization for d-dimensional sources and rth-pow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Optimality of Secret Key Agreement via Omniscience

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1126 KB)

    For the multiterminal secret key agreement problem under a private source model, it is known that the maximum key rate, i.e., the secrecy capacity, can be achieved through communication for omniscience, but the omniscience strategy can be strictly suboptimal in terms of minimizing the public discussion rate. While a single-letter characterization is not known for the minimum discussion rate needed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Youla Coding and Computation of Gaussian Feedback Capacity

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (351 KB)

    In this paper, we propose an approach to numerically compute the feedback capacity of stationary finite dimensional Gaussian channels and construct (arbitrarily close to) capacity-achieving feedback codes. In particular, we first extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of findi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A construction of odd length generators for optimal families of perfect sequences

    Publication Year: 2018, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (418 KB)

    In this paper, we give a construction of optimal families of N-ary perfect sequences of period N2, where N is a positive odd integer. For this, we re-define perfect generators and optimal generators of any length N which were originally defined only for odd prime lengths by Park, Song, Kim, and Golomb in 2016, but investigate the necessary and sufficient condition for these generators for arbitrar... 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