# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 52

Publication Year: 2016, Page(s):C1 - C4
| PDF (177 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2016, Page(s): C2
| PDF (164 KB)
• ### Polar Codes for Arbitrary DMCs and Arbitrary MACs

Publication Year: 2016, Page(s):2917 - 2936
Cited by:  Papers (5)
| | PDF (476 KB) | HTML

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasi-group structure on the input alphabet. Just as with usual polar codes, the block error probability under successive cancellation decoding is o(2-N1/2ε), where N is the block length. Encoding and decoding for these codes can be implemented with a complexity of O(Nlog N). It is shown that the same tec... View full abstract»

• ### Universal Polarization

Publication Year: 2016, Page(s):2937 - 2946
Cited by:  Papers (2)
| | PDF (1010 KB) | HTML

A method to polarize channels universally is introduced. The method is based on combining channels of unequal capacities in each polarization step, as opposed to the standard method of combining identical channels. The locations of the good and bad channels that emerge upon polarization are only a function of the polar transform chosen, and are otherwise independent of the channel being polarized.... View full abstract»

• ### New Classes of Partial Geometries and Their Associated LDPC Codes

Publication Year: 2016, Page(s):2947 - 2965
Cited by:  Papers (2)
| | PDF (1423 KB) | HTML

The use of partial geometries to construct parity-check matrices for binary low-density parity-check (LDPC) codes has resulted in the design of successful codes with a probability of error on the AWGN channel close to the Shannon capacity at bit error rate down to $10^{-15}$ . Such considerations have motivated this further investigation. A new and simple construction of a type of partial geometri... View full abstract»

• ### The ADMM Penalized Decoder for LDPC Codes

Publication Year: 2016, Page(s):2966 - 2984
Cited by:  Papers (6)
| | PDF (1936 KB) | HTML

Linear programming (LP) decoding for low-density parity-check codes was introduced by Feldman et al. and has been shown to have theoretical guarantees in several regimes. Furthermore, it has been reported in the literature-via simulation and via instanton analysis-that LP decoding displays better error rate performance at high signal-to-noise ratios (SNR) than does belief propagation (BP) decoding... View full abstract»

• ### ADMM LP Decoding of Non-Binary LDPC Codes in $\mathbb {F}_{2^{m}}$

Publication Year: 2016, Page(s):2985 - 3010
Cited by:  Papers (3)
| | PDF (1946 KB) | HTML

In this paper, we develop efficient decoders for non-binary low-density parity-check codes using the alternating direction method of multipliers (ADMM). We apply ADMM to two decoding problems. The first problem is linear programming (LP) decoding. In order to develop an efficient algorithm, we focus on non-binary codes in fields of characteristic two. This allows us to transform each constraint in... View full abstract»

• ### On the Information Loss of the Max-Log Approximation in BICM Systems

Publication Year: 2016, Page(s):3011 - 3025
Cited by:  Papers (1)
| | PDF (1260 KB) | HTML

We present a comprehensive study of the information rate loss of the max-log approximation for M-ary pulse-amplitude modulation (PAM) in a bit-interleaved coded modulation (BICM) system. It is widely assumed that the calculation of L-values using the max-log approximation leads to an information loss. We prove that this assumption is correct for all M-PAM constellations and labelings with the exce... View full abstract»

• ### Successive Segmentation-Based Coding for Broadcasting Over Erasure Channels

Publication Year: 2016, Page(s):3026 - 3038
| | PDF (969 KB) | HTML

Motivated by error correction coding in multimedia applications, we study the problem of broadcasting a single common source to multiple receivers over heterogeneous erasure channels. Each receiver is required to partially reconstruct the source sequence by decoding a certain fraction of the source symbols. We propose a coding scheme that requires only off-the-shelf erasure codes and can be easily... View full abstract»

• ### Convolutional Codes With Maximum Column Sum Rank for Network Streaming

Publication Year: 2016, Page(s):3039 - 3052
Cited by:  Papers (6)
| | PDF (603 KB) | HTML

The column Hamming distance of a convolutional code determines the error correction capability when streaming over a class of packet erasure channels. We introduce a metric known as the column sum rank that parallels the column Hamming distance when streaming over a network with link failures. We prove the rank analogues of several known column Hamming distance properties and introduce a new famil... View full abstract»

• ### BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems

Publication Year: 2016, Page(s):3053 - 3069
Cited by:  Papers (5)
| | PDF (950 KB) | HTML

In distributed storage systems, regenerating codes can achieve the optimal tradeoff between storage capacity and repair bandwidth. However, a critical drawback of existing regenerating codes, in general, is the high coding and repair complexity, since the coding and repair processes involve expensive multiplication operations in finite field. In this paper, we present a design framework of regener... View full abstract»

• ### Bounds on the Parameters of Locally Recoverable Codes

Publication Year: 2016, Page(s):3070 - 3083
Cited by:  Papers (9)
| | PDF (407 KB) | HTML

A locally recoverable code (LRC code) is a code over a finite alphabet, such that every symbol in the encoding is a function of a small number of other symbols that form a recovering set. In this paper, we derive new finite-length and asymptotic bounds on the parameters of LRC codes. For LRC codes with a single recovering set for every coordinate, we derive an asymptotic Gilbert-Varshamov type bou... View full abstract»

• ### Efficient Non-Recursive Design of Second-Order Spectral-Null Codes

Publication Year: 2016, Page(s):3084 - 3102
| | PDF (983 KB) | HTML

A new efficient design of second-order spectralnull (2-OSN) codes is presented. The new codes are obtained by applying the technique used to design parallel decoding balanced (i.e., 1-OSN) codes to the random walk method introduced by some of the authors for designing 2-OSN codes. This gives new non-recursive efficient code designs, which are less redundant than the code designs found in the liter... View full abstract»

• ### On Optimal Nonlinear Systematic Codes

Publication Year: 2016, Page(s):3103 - 3112
| | PDF (283 KB) | HTML

Most bounds on the size of codes hold for any code, whether linear or not. Notably, the Griesmer bound holds only in the linear case and so optimal linear codes are not necessarily optimal codes. In this paper, we identify code parameters (q, d, k), namely, field size, minimum distance, and combinatorial dimension, for which the Griesmer bound also holds in the (systematic) nonlinear case. Moreove... View full abstract»

• ### Systematic Error-Correcting Codes for Permutations and Multi-Permutations

Publication Year: 2016, Page(s):3113 - 3124
| | PDF (290 KB) | HTML

Multi-permutations and in particular permutations appear in various applications in an information theory. New applications, such as rank modulation for flash memories, have suggested the need to consider error-correcting codes for multi-permutations. In this paper, we study systematic error-correcting codes for multi-permutations in general and for permutations in particular. For a given number o... View full abstract»

• ### Codes for DNA Sequence Profiles

Publication Year: 2016, Page(s):3125 - 3146
Cited by:  Papers (4)
| | PDF (1879 KB) | HTML

We consider the problem of storing and retrieving information from synthetic DNA media. We introduce the DNA storage channel and model the read process through the use of profile vectors. We provide an asymptotic analysis of the number of profile vectors and propose new asymmetric coding techniques to combat the effects of synthesis and sequencing noise. Furthermore, we construct two families of c... View full abstract»

• ### Variable-Rate Linear Network Error Correction MDS Codes

Publication Year: 2016, Page(s):3147 - 3164
| | PDF (537 KB) | HTML

In network communication, the source often transmits messages at several different information rates within a session. How to deal with information transmission and network error correction simultaneously under different rates is introduced in this paper as a variable-rate network error correction problem. Apparently, linear network error correction maximum distance separable (MDS) codes are expec... View full abstract»

• ### The Single-Uniprior Index-Coding Problem: The Single-Sender Case and the Multi-Sender Extension

Publication Year: 2016, Page(s):3165 - 3182
Cited by:  Papers (8)
| | PDF (2041 KB) | HTML

Index coding studies multiterminal source-coding problems where a set of receivers are required to decode multiple (possibly different) messages from a common broadcast, and they each know some messages a priori. In this paper, at the receiver end, we consider a special setting where each receiver knows only one message a priori, and each message is known to only one receiver. At the broadcasting ... View full abstract»

• ### Alignment-Based Network Coding for Two-Unicast-Z Networks

Publication Year: 2016, Page(s):3183 - 3211
| | PDF (1291 KB) | HTML

In this paper, we study the wireline two-unicast-Z communication network over directed acyclic graphs. The two-unicast-$Z$ network is a two-unicast network where the destination intending to decode the second message has a priori side information of the first message. We make three contributions in this paper. First, we describe a new linear network coding algorithm for two-unicast-Z networks over... View full abstract»

• ### Hierarchical Coded Caching

Publication Year: 2016, Page(s):3212 - 3229
Cited by:  Papers (14)
| | PDF (726 KB) | HTML

Caching of popular content during off-peak hours is a strategy to reduce network loads during peak hours. Recent work has shown significant benefits of designing such caching strategies not only to locally deliver the part of the content, but also to provide coded multicasting opportunities even among users with different demands. Exploiting both of these gains was shown to be approximately optima... View full abstract»

• ### On the Throughput-Delay Tradeoff in Georouting Networks

Publication Year: 2016, Page(s):3230 - 3242
Cited by:  Papers (1)
| | PDF (1249 KB) | HTML

We study the scaling properties of a georouting scheme in a wireless multi-hop network of n mobile nodes. Our aim is to increase the network capacity quasi-linearly with n, while keeping the average delay bounded. In our model, we consider mobile nodes moving according to an independent identically distributed random walk with velocity v and transmitting packets to randomly chosen fixed and known ... View full abstract»

Publication Year: 2016, Page(s):3243 - 3269
Cited by:  Papers (1)
| | PDF (3176 KB) | HTML

A key aspect of many resource allocation problems is the need for the resource controller to compute a function, such as the max or arg max, of the competing users' metrics. Information must be exchanged between the competing users and the resource controller in order for this function to be computed. In many practical resource controllers, the competing users' metrics are communicated to the reso... View full abstract»

• ### Successive Omniscience

Publication Year: 2016, Page(s):3270 - 3289
Cited by:  Papers (7)
| | PDF (628 KB) | HTML

Because the exchange of information among all the users in a large network can take a long time, a successive omniscience protocol is proposed. Namely, subgroups of users first recover the information of other users in the same subgroup at an earlier stage called local omniscience. Then, the users recover the information of all other users at a later stage called global omniscience. To facilitate ... View full abstract»

• ### Structural Information and Dynamical Complexity of Networks

Publication Year: 2016, Page(s):3290 - 3339
Cited by:  Papers (2)
| | PDF (2531 KB) | HTML

In 1953, Shannon proposed the question of quantification of structural information to analyze communication systems. The question has become one of the longest great challenges in information science and computer science. Here, we propose the first metric for structural information. Given a graph G , we define the K-dimensional structural information of G (or structure entropy of G), denoted by H<... View full abstract»

• ### Arbitrarily Tight Bounds on Differential Entropy of Gaussian Mixtures

Publication Year: 2016, Page(s):3340 - 3354
Cited by:  Papers (4)
| | PDF (1209 KB) | HTML

A sequence of lower and upper bounds is derived on the differential entropy of a Gaussian mixture where the Gaussian components only differ in mean values. As the sequence index increases, the computational complexity of the bounds increases; however, the gap between the lower and upper bounds becomes vanishingly small. We address the applications of these bounds in several communication scenarios... View full abstract»

## 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