Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

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 203
  • Refined Asymptotics for Rate-Distortion using Gaussian Codebooks for Arbitrary Sources

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

    The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance encoding is employed. We extend Lapidoth’s analysis in several directions in this paper. Firstly, we consider refined asymptotics. In particular, when the source... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Accuracy-Privacy Trade-Off for Secure Computations

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

    The purpose of Secure Multi-Party Computation is to enable protocol participants to compute a public function of their private inputs while keeping their inputs secret, without resorting to any trusted third party. However, opening the public output of such computations inevitably reveals some information about the private inputs. We propose a measure generalising both Rényi entropy and g-entropy ... View full abstract»

    Open Access
  • Verifiably Multiplicative Secret Sharing

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

    A d-multiplicative secret sharing (d-MSS) scheme allows the players to multiply d shared secrets without recovering the secrets by converting their shares locally into an additive sharing of the product. It has been proved that d-MSS among n players is possible if and only if no d unauthorized sets of players cover the whole set of players (type Qd). Although this result implies some limitations o... View full abstract»

    Open Access
  • Matched Metrics to the Binary Asymmetric Channels

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

    In this paper we establish some criteria to decide when a discrete memoryless channel admits a metric in such a way that the maximum likelihood decoding coincides with the nearest neighbor decoding. In particular we prove a conjecture presented by M. Firer and J. L. Walker establishing that every binary asymmetric channel admits a matched metric. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rényi Resolvability and Its Applications to the Wiretap Channel

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

    The conventional channel resolvability problem refers to the determination of the minimum rate required for an input process so that the output distribution approximates a target distribution in either the total variation distance or the relative entropy. In contrast to previous works, in this paper, we use the (normalized or unnormalized) Rényi divergence (with the Rényi parameter in [0,2] ∪ {∞})... View full abstract»

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

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

    Every channel can be expressed as a convex combination of deterministic channels with each deterministic channel corresponding to one particular intrinsic state. Such convex combinations are in general not unique, each giving rise to a specific intrinsic-state distribution. In this paper we study the maximum and the minimum capacities of a channel when the realization of its intrinsic state is cau... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Stopping for Interval Estimation in Bernoulli Trials

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

    We propose an optimal sequential methodology for obtaining confidence intervals for a binomial proportion θ. Assuming that an i.i.d. sequence of Bernoulli(θ) trials is observed sequentially, we are interested in designing (i) a stopping time T that will decide the best time to stop sampling the process, and (ii) an optimum estimator θT that will provide the optimum center of the interval estimate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-dimensional classification by sparse logistic regression

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

    We consider high-dimensional binary classification by sparse logistic regression. We propose a model/feature selection procedure based on penalized maximum likelihood with a complexity penalty on the model size and derive the nonasymptotic bounds for its misclassification excess risk. To assess its tightness we establish the corresponding minimax lower bounds. The bounds can be reduced under the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning High-dimensional Generalized Linear Autoregressive Models

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

    Vector autoregressive models characterize a variety of time series in which linear combinations of current and past observations can be used to accurately predict future observations. For instance, each element of an observation vector could correspond to a different node in a network, and the parameters of an autoregressive model would correspond to the impact of the network structure on the time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Capacity of Private Information Retrieval with Eavesdroppers

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

    We consider the problem of private information retrieval (PIR) with colluding servers and eavesdroppers (abbreviated as ETPIR). The ETPIR problem is comprised of K messages, N servers where each server stores all K messages, a user who wants to retrieve one of the K messages without revealing the desired message index to any set of T colluding servers, and an eavesdropper who can listen to the que... View full abstract»

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

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

    We extend the notion of list decoding to ratio list decoding which involves a list decoder whose list size is specified as a function of the number of messages Mn and the block length n. We present necessary and sufficient conditions on Mn for the existence of code sequences which enable reliable list decoding with respect to the desired list size L(Mn; n). It is shown that the ratio-capacity, def... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Function Computation through a Bidirectional Relay

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

    We consider a function computation problem in a three node wireless network. Nodes A and B observe two correlated sources X and Y respectively, and want to compute a function f(X,Y). To achieve this, nodes A and B send messages to a relay node C at rates RA and RB respectively. The relay C then broadcasts a message to A and B at rate RC. We allow block coding, and study the achievable region of ra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity-Achieving Codes that Mitigate Intercell Interference and Charge Leakage in Flash Memories

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

    We investigate constant-composition constrained codes for mitigation of intercell interference for multilevel cell flash memories with dynamic threshold scheme. The first explicit formula for the maximum size of a q-ary F-avoiding code with a given composition and certain families of substrings F is presented. In addition, we provide methods to determine the asymptotic rate for F-avoiding codes wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On ZpZpk-additive codes and their duality

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

    In this paper, two different Gray-like maps from Zα p × Zβ pk , where p is prime, to Zn p, n = α + βpk–1, denoted by ϕ and φ, respectively, are presented. We have determined the connection between the weight enumerators among the image codes under these two mappings. We show that if C is a ZpZpk - additive code, and C┴ is its dual, then the weight enumerators of the image p-ary codes ϕ(C) and φ(C┴... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures with almost optimal node size

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

    The repair problem in distributed storage addresses recovery of the data encoded using an erasure code, for instance, a Reed-Solomon (RS) code. We consider the problem of repairing a single node or multiple nodes in RS-coded storage systems using the smallest possible amount of inter-nodal communication. According to the cut-set bound, communication cost of repairing h ⩾ 1 failed nodes for an (n,k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes with Colluding Servers

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

    SupposeM records are replicated in N servers (each storing all M records), and a user wants to privately retrieve one record by accessing the servers such that the identity of the retrieved record is secret against any up to T servers. A scheme designed for this purpose is called a T-PIR (private information retrieval) scheme. In practice, capacity-achieving and small sub-packetization are both de... View full abstract»

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

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

    In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary spectral density. We introduce a new approach to the problem where we solve the problem over a finite number of transmissions and then consider the limit of an inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Sphere Packing Bound via Augustin’s Method

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

    A sphere packing bound (SPB) with a prefactor that is polynomial in the block length n is established for codes on a length n product channel W[1,n] assuming that the maximum order ½ Rényi capacity among the component channels, i.e. maxt≤n C1/2;Wt, is O(ln n). The reliability function of the discrete stationary product channels with feedback is bounded from above by the sphere packing exponent. Bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noisy Adaptive Group Testing: Bounds and Algorithms

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

    The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and many more. One of the defining features of the group testing problem is the distinction between the non-adaptive and adaptive settings: In the no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind Gain and Phase Calibration via Sparse Spectral Methods

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

    Blind gain and phase calibration (BGPC) is a bilinear inverse problem involving the determination of unknown gains and phases of the sensing system, and the unknown signal, jointly. BGPC arises in numerous applications, e.g., blind albedo estimation in inverse rendering, synthetic aperture radar autofocus, and sensor array auto-calibration. In some cases, sparse structure in the unknown signal all... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalised Entropies and Metric-Invariant Optimal Countermeasures for Information Leakage under Symmetric Constraints

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

    We introduce a novel generalization of entropy and conditional entropy from which most definitions from the literature can be derived as particular cases. Within this general framework, we investigate the problem of designing countermeasures for information leakage. In particular, we seek metric-invariant solutions, i.e., they are robust against the choice of entropy for quantifying the leakage. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On two classes of primitive BCH codes and some related codes

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

    BCH codes are an interesting type of cyclic codes and have wide applications in communication and storage systems. Generally, it is very hard to determine the minimum distances of BCH codes. In this paper, we determine the weight distributions of two classes of primitive BCH codes C(q,m,δ2) and C(q,m,δ3) and their extended codes, which solve two problems proposed by Ding et al. [13]. It is shown t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum Query Complexity of Entropy Estimation

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

    Estimation of Shannon and Rényi entropies of unknown discrete distributions is a fundamental problem in statistical property testing. In this paper, we give the first quantum algorithms for estimating α-Rényi entropies (Shannon entropy being 1-Rényi entropy). In particular, we demonstrate a quadratic quantum speedup for Shannon entropy estimation and a generic quantum speedup for α-Rényi entropy e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fundamental Limits of Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching

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

    We consider the problem of private information retrieval (PIR) from N non-colluding and replicated databases when the user is equipped with a cache that holds an uncoded fraction r from each of the K stored messages in the databases. We assume that the databases are unaware of the cache content. We investigate D*(r) the optimal download cost normalized with the message size as a function of K, N, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Wiretap Channel with Generalized Feedback: Secure Communication and Key Generation

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

    It is a well-known fact that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this work, an achievable scheme for the wiretap channel with generalized feedback is presented. This scheme, which uses the feedback signal to generate a shared secret key between the legitimate users, encrypts the ... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu