IEEE Transactions on Information Theory

Volume 63 Issue 1 • Jan. 2017

Filter Results

Displaying Results 1 - 25 of 49
  • Table of contents

    Publication Year: 2017, Page(s):C1 - C4
    Request permission for commercial reuse | PDF file iconPDF (156 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 (110 KB)
    Freely Available from IEEE
  • 2016 IEEE Information Theory Society Paper Award

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

    Publication Year: 2017, Page(s):3 - 4
    Request permission for commercial reuse | PDF file iconPDF (581 KB) | HTML iconHTML
    Freely Available from IEEE
  • Distributed Structure: Joint Expurgation for the Multiple-Access Channel

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

    In this paper, we obtain an improved lower bound on the error exponent of the memoryless multiple-access channel via the use of linear codes, thus demonstrating that structure can be beneficial even when capacity may be achieved via random codes. We show that if the multiple-access channel is additive over a finite field, then any error probability, and hence any error exponent, achievable by a li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Unifying Order-Theoretic Framework for Superposition Coding: Polymatroidal Structure and Optimality in the Multiple-Access Channel With General Message Sets

    Publication Year: 2017, Page(s):21 - 37
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB) | HTML iconHTML

    Two different random coding techniques, both referred to as superposition coding in the literature, have been widely used to obtain inner bounds for the capacity regions of various communication networks. In one, auxiliary codewords are generated independently, and in the other, they are generated in a dependent manner. Using the multiple-access channel with general message sets as a case study, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating Renyi Entropy of Discrete Distributions

    Publication Year: 2017, Page(s):38 - 56
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (841 KB) | HTML iconHTML

    It was shown recently that estimating the Shannon entropy H(p) of a discrete k-symbol distribution p requires Θ(k/log k) samples, a number that grows near-linearly in the support size. In many applications, H(p) can be replaced by the more general Rényi entropy of order α and Hα(p). We determine the number of samples needed to estimate Hα(p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semiparametric Estimation of Mutual Information and Related Criteria: Optimal Test of Independence

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

    We derive independence tests by means of dependence measures thresholding in a semiparametric context. Precisely, the estimates of φ-mutual informations, associated to φ-divergences between a joint distribution and the product distribution of its marginals, are derived through the dual representation of φ-divergences. The asymptotic properties of the proposed estimates are est... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Capacity of a Class of Channels With Coded Side Information at the Decoder

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

    We study the Ahslwede-Han problem of a pointto-point communication with partial state information available at the destination. For a class of channels, by establishing a tight converse, we show that the Wyner-Ziv compression of the channel state treating the destination's channel output as side information is optimal. This result is more general than the modulo-sum channel studied by Aleksic et a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Dispersion of Nearest-Neighbor Decoding for Additive Non-Gaussian Channels

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

    We study the second-order asymptotics of information transmission using random Gaussian codebooks and nearest neighbor decoding over a power-limited stationary memoryless additive non-Gaussian noise channel. We show that the dispersion term depends on the non-Gaussian noise only through its second and fourth moments, thus complementing the capacity result (Lapidoth, 1996), which depends only on th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Bound on the Fraction of Correctable Deletions

    Publication Year: 2017, Page(s):93 - 103
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (383 KB) | HTML iconHTML

    We consider codes over fixed alphabets against worst case symbol deletions. For any fixed k ≥ 2, we construct a family of codes over alphabet of size k with positive rate, which allow efficient recovery from a worst case deletion fraction approaching 1 - (2/(k + √k)). In particular, for binary codes, we are able to recover a fraction of deletions approaching 1/(√2+1) = √... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfect Snake-in-the-Box Codes for Rank Modulation

    Publication Year: 2017, Page(s):104 - 110
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (670 KB) | HTML iconHTML

    For odd n, the alternating group on n elements is generated by the permutations that jump an element from an odd position to position 1. We prove Hamiltonicity of the associated directed Cayley graph for all odd n ≠ 5 (a result of Rankin implies that the graph is not Hamiltonian for n = 5). This solves a problem arising in rank modulation schemes for flash memory. Our result disproves a con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layered Constructions for Low-Delay Streaming Codes

    Publication Year: 2017, Page(s):111 - 141
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4393 KB) | HTML iconHTML

    We study error correction codes for multimedia streaming applications where a stream of source packets must be transmitted in real-time, with in-order decoding, and strict delay constraints. In our setup, the encoder observes a stream of source packets in a sequential fashion, and M channel packets must be transmitted between the arrival of successive source packets. Each channel packet can depend... View full abstract»

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

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

    In this paper, list decoding of crisscross errors in arrays over finite fields is considered. For this purpose, the so-called cover metric is used, where the cover of a matrix is a set of rows and columns which contains all non-zero elements of the matrix. A Johnson-like upper bound on the maximum list size in the cover metric is derived, showing that the list of codewords has polynomial size up t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region

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

    An explicit construction of an infinite family of cyclic codes is presented which, over GF(4) (resp., GF(8)), have approximately 8/9 (resp., 48/49) the redundancy of BCH codes of the same minimum distance and length. As such, the new codes are the best codes currently known in a regime where the minimum distance is fixed and the code length goes to infinity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List Decodability of Random Subcodes of Gabidulin Codes

    Publication Year: 2017, Page(s):159 - 163
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (165 KB) | HTML iconHTML

    Efficient list decoding of rank-metric codes seems more difficult compared with classical block codes although list decodability of random rank-metric codes is completely determined by Ding. For example, it was shown by Raviv and Wachter-Zeh that the list decoding radius of Gabidulin codes is the same as the unique decoding radius, i.e., half the minimum distance for some instances of parameters. ... View full abstract»

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

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

    We give an infinite family of maximum rank distance (MRD) codes, which covers properly the largest known linear MRD code family. Our family contains infinite families of non-linear MRD codes, which are the first non-linear examples for most of the parameters. We also give explicit examples and a table that demonstrates the proportion of linear and non-linear families for some small parameters. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Construction of Linear Codes Over ${\mathbb {F}}_{2^t}$ From Boolean Functions

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

    In this paper, we present a construction of linear codes over F2t from Boolean functions, which is a generalization of Ding's method. Based on this construction, we give two classes of linear codes C̃f and Cf over F2t from a Boolean function f : Fq → F2, where q = 2n and F2t is some subfield of F<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on One Weight and Two Weight Projective $\mathbb {Z}_{4}$ -Codes

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

    In this paper, we solve the open problems raised in [8] and present some examples to illustrate the obtained results. Moreover, we work out the diophantine problem by Shi and Wang and then give the sufficient conditions for the nonexistence of two-Lee weight projective codes over Z4 with type 4k12k2. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Ingleton-Violating Finite Groups

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

    Given n discrete random variables, its entropy vector is the 2n - 1-dimensional vector obtained from the joint entropies of all non-empty subsets of the random variables. It is well known that there is a close relation between such an entropy vector and a certain group-characterizable vector obtained from a finite group and n of its subgroups; indeed, roughly speaking, knowing the regio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Class of Non-Linearly Solvable Networks

    Publication Year: 2017, Page(s):201 - 229
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1277 KB) | HTML iconHTML

    For each positive composite integer m, a network is constructed, which is solvable over an alphabet of size m but is not solvable over any smaller alphabet. These networks have no linear solutions over any module alphabets and are not asymptotically linearly solvable over any finite-field alphabets. The networks' capacities are all shown to equal one, and their linear capacities are all shown to b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel Diversity Coding Systems: Rate Regions, Codes, Computation, & Forbidden Minors

    Publication Year: 2017, Page(s):230 - 251
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2862 KB)

    The rate regions of multilevel diversity coding systems (MDCSs), a sub-class of the broader family of multi-source multi-sink networks with special structure, are investigated in a systematic way. We enumerate all non-isomorphic MDCS instances with at most three sources and four encoders. Then, the exact rate region of every one of these more than 7000 instances is proven via computations showing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast

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

    This paper considers network communications under a hard timeliness constraint, where a source node streams perishable information to a destination node over a directed acyclic graph subject to a hard delay constraint. Transmission along any edge incurs unit delay, and it is required that every information bit generated at the source at the beginning of time t to be received and recovered by the d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Multicast Tree Construction in Wireless Sensor Networks

    Publication Year: 2017, Page(s):280 - 296
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1244 KB) | HTML iconHTML

    Multicast tree is a key structure for data dissemination from one source to multiple receivers in wireless networks. Minimum length multica modeled as the Steiner tree problem, and is proven to be NP-hard. In this paper, we explore how to efficiently generate minimum length multi wireless sensor networks (WSNs), where only limited knowledge of network topology is available at each node. We design ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Degrees of Freedom of the MIMO X-Channel With Delayed CSIT

    Publication Year: 2017, Page(s):297 - 319
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1170 KB) | HTML iconHTML

    We study the degrees of freedom (DoFs) of the multiple-input multiple-output X-channel (MIMO XC) with delayed channel state information at the transmitters (delayed CSITs), assuming linear coding strategies at the transmitters. We present two results: 1) the linear sum DoF for MIMO XC with general antenna configurations and 2) the linear DoF region for MIMO XC with symmetric antennas. The converse... 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