IEEE Transactions on Information Theory

Issue 1 • Jan. 2018

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 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 46
  • Table of contents

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

    Publication Year: 2018, Page(s): C2
    Request permission for commercial reuse | |PDF file iconPDF (110 KB)
    Freely Available from IEEE
  • 2017 IEEE Information Theory Society Paper Award

    Publication Year: 2018, Page(s):1 - 2
    Request permission for commercial reuse | |PDF file iconPDF (3946 KB)
    Freely Available from IEEE
  • 2017 IEEE Communications Society and Information Theory Society Joint Paper Award

    Publication Year: 2018, Page(s): 3
    Request permission for commercial reuse | |PDF file iconPDF (919 KB)
    Freely Available from IEEE
  • Arimoto–Rényi Conditional Entropy and Bayesian $M$ -Ary Hypothesis Testing

    Publication Year: 2018, Page(s):4 - 25
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (739 KB)

    This paper gives upper and lower bounds on the minimum error probability of Bayesian M-ary hypothesis testing in terms of the Arimoto-Rényi conditional entropy of an arbitrary order α. The improved tightness of these bounds over their specialized versions with the Shannon conditional entropy (α = 1) is demonstrated. In particular, in the case where M is finite, we show how to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive Communication for Data Exchange

    Publication Year: 2018, Page(s):26 - 37
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (528 KB)

    Two parties observing correlated data seek to exchange their data using interactive communication. How many bits must they communicate? We propose a new interactive protocol for data exchange, which increases the communication size in steps until the task is done. We also derive a lower bound on the minimum number of bits that is based on relating the data exchange problem to the secret key agreem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Communication Channel With Random Battery Recharges

    Publication Year: 2018, Page(s):38 - 56
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (856 KB)

    Motivated by the recent emergence of energy harvesting and wirelessly powered transceivers, we study communication over a memoryless channel with a transmitter, whose battery is recharged at random or deterministic times known to the receiver. We characterize the capacity of this channel as the limit of an n-letter maximum mutual information rate under various assumptions: causal and noncausal tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Change of Multivariate Mutual Information: From Local to Global

    Publication Year: 2018, Page(s):57 - 76
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1179 KB)

    We study the change of multivariate mutual information among a set of random variables when some common randomness is added to or removed from a subset of the random variables. This is formulated more precisely as two new multiterminal secret key agreement problems that, respectively, ask how one can increase the secrecy capacity efficiently by adding common randomness to a small subset of users, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy Bounds on Abelian Groups and the Ruzsa Divergence

    Publication Year: 2018, Page(s):77 - 92
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (291 KB)

    Over the past few years, a family of interesting new inequalities for the entropies of sums and differences of random variables has been developed by Ruzsa, Tao, and others, motivated by analogous results in additive combinatorics. This paper extends these earlier results to the case of random variables taking values in Rn or, more generally, in arbitrary locally compact and Polish abelian groups.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intrinsic Entropies of Log-Concave Distributions

    Publication Year: 2018, Page(s):93 - 108
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (342 KB)

    The entropy of a random variable is well-known to equal the exponential growth rate of the volumes of its typical sets. In this paper, we show that for any log-concave random variable X, the sequence of the [nθ]th intrinsic volumes of the typical sets of X in dimensions n ≥ 1 grows exponentially with a well-defined rate. We denote this rate by hX (&#x... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fundamental Tradeoff Between Computation and Communication in Distributed Computing

    Publication Year: 2018, Page(s):109 - 128
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1566 KB)

    How can we optimally trade extra computing power to reduce the communication load in distributed computing? We answer this question by characterizing a fundamental tradeoff between computation and communication in distributed computing, i.e., the two are inversely proportional to each other. More specifically, a general distributed computing framework, motivated by commonly used structures like Ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss

    Publication Year: 2018, Page(s):129 - 147
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (707 KB)

    This paper considers the problem of lossy source coding with a specific distortion measure: logarithmic loss. The focus of this paper is on the single-shot approach, which exposes crisply the connection between lossless source coding with list decoding and lossy source coding with log-loss. Fixed-length and variable-length bounds are presented. Fixed-length bounds include the single-shot fundament... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotics of Input-Constrained Erasure Channel Capacity

    Publication Year: 2018, Page(s):148 - 162
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (428 KB)

    In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an irreducible finite-type constraint, we derive partial asymptotics of its capacity, using some series expansion type formula of its mutual information rate; and for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extremality Between Symmetric Capacity and Gallager’s Reliability Function $E_{0}$ for Ternary-Input Discrete Memoryless Channels

    Publication Year: 2018, Page(s):163 - 191
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3472 KB)

    This paper examines the exact ranges between the symmetric capacity and Gallager's reliability function E0 for ternary-input discrete memoryless channels (T-DMCs) under a uniform input distribution. We first derive the two extremal ternary-input strongly symmetric channels taking the maximum and minimum values of the E0 function among all ternary-input strongly symmetric chan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Rank Weights of Reducible Codes, Optimal Cases, and Related Properties

    Publication Year: 2018, Page(s):192 - 204
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (270 KB)

    Reducible codes for the rank metric were introduced for cryptographic purposes. They have fast encoding and decoding algorithms, include maximum rank distance (MRD) codes, and can correct many rank errors beyond half of their minimum rank distance, which makes them suitable for error correction in network coding. In this paper, we study their security behavior against information leakage on networ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatially Coupled Split-Component Codes With Iterative Algebraic Decoding

    Publication Year: 2018, Page(s):205 - 224
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (775 KB)

    We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bit-rate optical-fiber communication systems. A spatially coupled split-component ensemble is defined, generalizing from the most important codes of this class, staircase codes and braided block codes, and preserving a deterministic partitioning of component-code bits over code blocks. Our analy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Density of Spherically Embedded Stiefel and Grassmann Codes

    Publication Year: 2018, Page(s):225 - 248
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1571 KB) | HTML iconHTML

    The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. A high density indicates that a code performs well when used as a uniform point-wise discretization of an ambient space. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal distance arising from an Euclidean embedding, i... View full abstract»

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

    Publication Year: 2018, Page(s):249 - 256
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (298 KB)

    We present composition check codes for noisy storage and transmission channels with unknown gain and/or offset. In the proposed composition check code, like in systematic error correcting codes, the encoding of the main data into a constant composition code is completely avoided. To the main data, a coded label is appended that carries information regarding the composition vector of the main data.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Codes Achieving Zero Error Capacities in Limited Magnitude Error Channels

    Publication Year: 2018, Page(s):257 - 273
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (734 KB)

    Shannon in his 1956 seminal paper introduced the concept of the zero error capacity, C0, of a noisy channel. This is defined as the least upper bound of rates, at which, it is possible to transmit information with zero probability of error. At present not many codes are known to achieve the zero error capacity. In this paper, some codes which achieve zero error capacities in limited mag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Network Coding Over Rings – Part I: Scalar Codes and Commutative Alphabets

    Publication Year: 2018, Page(s):274 - 291
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (898 KB)

    Linear network coding over finite fields is a wellstudied problem. We consider the more general setting of linear coding for directed acyclic networks with finite commutative ring alphabets. Our results imply that for scalar linear network coding over commutative rings, fields can always be used when the alphabet size is flexible, but other rings may be needed when the alphabet size is fixed. We p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Network Coding Over Rings – Part II: Vector Codes and Non-Commutative Alphabets

    Publication Year: 2018, Page(s):292 - 308
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (601 KB)

    In Part I, we studied linear network coding over finite commutative rings and made comparisons to the well-studied case of linear network coding over finite fields. Here, we consider the more general setting of linear network coding over finite (possibly non-commutative) rings and modules. We prove the following results regarding the linear solvability of directed acyclic networks over various fin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of Polar Codes for Arbitrary Discrete Memoryless Channels

    Publication Year: 2018, Page(s):309 - 321
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (719 KB)

    It is known that polar codes can be efficiently constructed for binary-input channels. At the same time, existing algorithms for general input alphabets are less practical because of high complexity. We address the construction problem for the general case, and analyze an algorithm that is based on successive reduction of the output alphabet size of the subchannels in each recursion step. For this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-Length Analysis of BATS Codes

    Publication Year: 2018, Page(s):322 - 348
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1761 KB)

    BATS codes were proposed for communication through networks with packet loss. A BATS code consists of an outer code and an inner code. The outer code is a matrix generation of a fountain code, which works with the inner code that comprises random linear coding at the intermediate network nodes. In this paper, the performance of finite-length BATS codes is analyzed with respect to both belief propa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coded Caching Under Arbitrary Popularity Distributions

    Publication Year: 2018, Page(s):349 - 366
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1416 KB)

    Caching plays an important role in reducing the backbone traffic when serving high-volume multimedia content. Recently, a new class of coded caching schemes have received significant interest, because they can exploit coded multi-cast opportunities to further reduce backbone traffic. Without considering file popularity, prior works have characterized the fundamental performance limits of coded cac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of Bent Monomials, Constructions of Bent Multinomials and Upper Bounds on the Nonlinearity of Vectorial Functions

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

    This paper is composed of two main parts related to the nonlinearity of vectorial functions. The first part is devoted to maximally nonlinear (n, m) functions (the so-called bent vectorial functions), which contribute to an optimal resistance to both linear and differential attacks on symmetric cryptosystems. They can be used in block ciphers at the cost of additional diffusion/compression/expansi... 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