# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 44

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

Publication Year: 2016, Page(s): C2
| PDF (142 KB)
• ### 2015 IEEE Information Theory Society Paper Award

Publication Year: 2016, Page(s): 1
| PDF (174 KB) | HTML
• ### 2015 IEEE Communications Society and Information Theory Society Joint Paper Award

Publication Year: 2016, Page(s): 2
| PDF (486 KB) | HTML
• ### Zero-Error Capacity of Binary Channels With Memory

Publication Year: 2016, Page(s):3 - 7
Cited by:  Papers (2)
| | PDF (175 KB) | HTML

We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with memory and solve some of the non-trivial cases. View full abstract»

• ### The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint

Publication Year: 2016, Page(s):8 - 22
Cited by:  Papers (11)
| | PDF (1093 KB) | HTML

The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1, ∞)-RLL constraint. We derive the capacity for this setting, which can be expressed as Cε= max0≤ p≤0.5((1-ε)Hb(p))/(1+(1-ε)p) , where ε is the erasure probability and Hb(·) is the binary entropy functi... View full abstract»

• ### On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem

Publication Year: 2016, Page(s):23 - 34
Cited by:  Papers (9)
| | PDF (545 KB) | HTML

This paper starts by considering the minimization of the Rényi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points (D(QIIP1), D(QIIP2)) is determined when P1, P2, and Q are arbitrary probability measures which are mutually absolutely continuous, and the tota... View full abstract»

• ### Dissipation of Information in Channels With Input Constraints

Publication Year: 2016, Page(s):35 - 55
Cited by:  Papers (18)
| | PDF (646 KB) | HTML

One of the basic tenets in information theory, the data processing inequality states that the output divergence does not exceed the input divergence for any channel. For channels without input constraints, various estimates on the amount of such contraction are known, Dobrushin's coefficient for the total variation being perhaps the most well-known. This paper investigates channels with an average... View full abstract»

• ### A Unified Graphical Approach to Random Coding for Single-Hop Networks

Publication Year: 2016, Page(s):56 - 88
Cited by:  Papers (7)
| | PDF (4436 KB) | HTML

A unified graphical approach to random coding for any memoryless, single-hop, K -user channel with or without common information is defined through two steps. The first step is user virtualization. Each user is divided into multiple virtual sub-users according to a chosen rate-splitting strategy. This results in an enhanced channel with a possibly larger number of users for which more coding possi... View full abstract»

• ### Short Message Noisy Network Coding With a Decode–Forward Option

Publication Year: 2016, Page(s):89 - 107
Cited by:  Papers (18)
| | PDF (1660 KB) | HTML

Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Two properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where each no... View full abstract»

• ### Non-Random Coding Error Bounds for Lattices

Publication Year: 2016, Page(s):108 - 120
| | PDF (630 KB) | HTML

An upper bound on the error probability of specific lattices, based on their distance spectrum, is constructed. The derivation is accomplished using a simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry of numbers. In many ways, the new bound greatly resembles the Shulman-Feder bound for linear codes. Based on the new bound, error-exponent and channel-dispersion expressio... View full abstract»

• ### The Random Coding Bound Is Tight for the Average Linear Code or Lattice

Publication Year: 2016, Page(s):121 - 130
Cited by:  Papers (3)
| | PDF (357 KB) | HTML

In 1973, Gallager proved that the random-coding bound is exponentially tight for the random code ensemble at all rates, even below expurgation. This result explained that the random-coding exponent does not achieve the expurgation exponent due to the properties of the random ensemble, irrespective of the utilized bounding technique. It has been conjectured that this same behavior holds true for a ... View full abstract»

• ### Pearson Codes

Publication Year: 2016, Page(s):131 - 135
Cited by:  Papers (5)
| | PDF (401 KB) | HTML

The Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of q-ary codewords, called Pearson codes, that satisfy specific properties. We will analyze constructions and properties of optimal Pearson codes. We will compare the redundancy of optimal Pearson codes with the redund... View full abstract»

• ### Codes Correcting Erasures and Deletions for Rank Modulation

Publication Year: 2016, Page(s):136 - 150
Cited by:  Papers (7)
| | PDF (358 KB) | HTML

Error-correcting codes for permutations have received considerable attention in the past few years, especially in applications of the rank modulation scheme for flash memories. While codes over several metrics have been studied, such as the Kendall τ, Ulam, and Hamming distances, no recent research has been carried out for erasures and deletions over permutations. In rank modulation, flash memory ... View full abstract»

• ### Snake-in-the-Box Codes for Rank Modulation Under Kendall’s$\tau$-Metric

Publication Year: 2016, Page(s):151 - 158
Cited by:  Papers (8)
| | PDF (1082 KB) | HTML

For a Gray code in the scheme of rank modulation for flash memories, the codewords are permutations, and two consecutive codewords are obtained using a push-to-the-top operation. We consider the snake-in-the-box code under Kendall's τ-metric, which is a Gray code capable of detecting one Kendall's τ-error. We answer two open problems posed by Horovitz and Etzion. First, we prove the validity of a ... View full abstract»

• ### A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound

Publication Year: 2016, Page(s):159 - 162
| | PDF (291 KB) | HTML

Due to recent applications to communications over powerlines, multilevel flash memories, and block ciphers, permutation codes have received a lot of attention from both coding and mathematical communities. One of the benchmarks for good permutation codes is the Gilbert-Varshamov bound. Although there have been several constructions of permutation codes, the Gilbert-Varshamov bound still remains to... View full abstract»

• ### Searching for Binary and Nonbinary Block and Convolutional LDPC Codes

Publication Year: 2016, Page(s):163 - 183
Cited by:  Papers (19)
| | PDF (2157 KB) | HTML

A unified approach to search for and optimize codes determined by their sparse parity-check matrices is presented. Replacing the nonzero elements of a binary parity-check matrix (the base or parent matrix) either by circulants or by companion matrices of elements from a finite field GF(2<sup>m</sup>), we obtain quasi-cyclic low-density parity-check (LDPC) block codes and binary images ... View full abstract»

• ### Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups

Publication Year: 2016, Page(s):184 - 198
Cited by:  Papers (8)
| | PDF (401 KB) | HTML

The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non-trivial automorphism group. Such codes display then symmetries allowing compact parity-check or generator matrices. For instance, a key-reduction is obtained by taking quasi-cyclic (QC) or qua... View full abstract»

• ### On Determining Deep Holes of Generalized Reed–Solomon Codes

Publication Year: 2016, Page(s):199 - 207
Cited by:  Papers (3)
| | PDF (400 KB) | HTML

For a linear code, deep holes are defined to be vectors that are further away from codewords than all other vectors. The problem of deciding whether a received word is a deep hole for generalized Reed-Solomon (GRS) codes is proved to be co-NP-complete by Guruswami and Vardy. For the extended Reed-Solomon codes RSq(Fq, k), a conjecture was made to classify deep holes by Cheng ... View full abstract»

• ### Scalable Capacity Bounding Models for Wireless Networks

Publication Year: 2016, Page(s):208 - 229
Cited by:  Papers (1)
| | PDF (1470 KB) | HTML

The framework of network equivalence theory developed by Koetter et al. introduces a notion of channel emulation to construct noiseless networks as upper (respectively, lower) bounding models, which can be used to calculate the outer (respectively, inner) bounds for the capacity region of the original noisy network. Based on the network equivalence framework, this paper presents scalable upper and... View full abstract»

• ### Optimum Transmission Through the Multiple-Antenna Gaussian Multiple Access Channel

Publication Year: 2016, Page(s):230 - 243
Cited by:  Papers (3)
| | PDF (734 KB) | HTML

This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas, and various power constraints. The points of interest maximize general rate objectives that arise in practical communication scenarios. Achieving these points constitutes the task of jointly optimizing the time-sharing parameters, the input covariance m... View full abstract»

• ### On the Gaussian Many-to-One X Channel

Publication Year: 2016, Page(s):244 - 259
Cited by:  Papers (3)
| | PDF (1445 KB) | HTML

In this paper, the Gaussian many-to-one X channel (XC), which is a special case of general multiuser XC, is studied. In the Gaussian many-to-one XC, communication links exist between all transmitters and one of the receivers, along with a communication link between each transmitter and its corresponding receiver. As per the XC assumption, transmission of messages is allowed on all the links of the... View full abstract»

• ### Coding for Parallel Gaussian Bidirectional Relay Channels: A Deterministic Approach

Publication Year: 2016, Page(s):260 - 271
| | PDF (881 KB) | HTML

We study the capacity region of the parallel Gaussian bidirectional relay channel with L independent subchannels and propose efficient coding schemes for approaching the capacity limit within a constant gap. A two-step approach is considered. First, the corresponding finite field linear deterministic model is studied, for which linear network coding across sub-channels is shown to achieve the capa... View full abstract»

• ### On the Diversity of Linear Transceivers in MIMO AF Relaying Systems

Publication Year: 2016, Page(s):272 - 289
Cited by:  Papers (6)
| | PDF (1494 KB) | HTML

In this paper, we provide a comprehensive survey on designs and analyses of various relay-destination transceiving schemes, such as zero-forcing (ZF), minimum mean squared error (MMSE), and maximum information rate (MIR) criteria, in multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying systems. In the first part of the paper, we suggest a new framework for the transceiver design... View full abstract»

• ### Exploiting the$N$-to-1 Mapping in Compress-and-Forward Relaying

Publication Year: 2016, Page(s):290 - 308
Cited by:  Papers (2)
| | PDF (873 KB) | HTML

In this paper, a forward decoding procedure is developed for the compress-and-forward (CF) relaying scheme. This procedure uses a layered framework and is based on exploiting a feature of the N -to-1 mapping inherent in the underlying Wyner-Ziv binning. It is shown that exploiting this mapping enables the relaxation of the constraint on the rate of the relay codewords representing the bin indices.... 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
Alexander Barg

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

email: abarg-ittrans@ece.umd.edu