# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 37

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

Publication Year: 2016, Page(s): C2
| PDF (1477 KB)
• ### Design of Spatially Coupled LDPC Codes Over GF $(q)$ for Windowed Decoding

Publication Year: 2016, Page(s):4781 - 4800
Cited by:  Papers (3)
| | PDF (2001 KB) | HTML

In this paper, we study spatially coupled lowdensity parity-check (SC-LDPC) codes over finite fields GF(q), q ≥ 2, and develop design rules for q-ary SC-LDPC code ensembles based on their iterative belief propagation decoding thresholds, with particular emphasis on low-latency windowed decoding (WD). We consider transmission over both the binary erasure channel (BEC) and the binary-input additive ... View full abstract»

• ### Information-Theoretic Sneak-Path Mitigation in Memristor Crossbar Arrays

Publication Year: 2016, Page(s):4801 - 4813
Cited by:  Papers (9)
| | PDF (977 KB) | HTML

In a memristor crossbar array, functioning as a memory array, a memristor is positioned on each row-column intersection, and its resistance, low or high, represents two logical states. The state of every memristor can be sensed by the current flowing through the memristor. In this paper, we study the sneak path problem in crossbar arrays, in which current can sneak through other cells, resulting i... View full abstract»

• ### Snake-in-the-Box Codes for Rank Modulation under Kendall’s$\tau$-Metric in$S_{2n+2}$

Publication Year: 2016, Page(s):4814 - 4818
Cited by:  Papers (1)
| | PDF (461 KB) | HTML

Snake-in-the-box codes under Kendall's τ-metric are studied in the rank modulation scheme for flash memories, where codewords are a subset of permutations in Sn with minimal Kendall's τ-distance two, and two cyclically consecutive codewords are connected via a push-to-the-top operation. Studies so far restrict the push-to-the-top operations only on odd indices, resulting in a snake consisting of p... View full abstract»

• ### Restricted Composition Deletion Correcting Codes

Publication Year: 2016, Page(s):4819 - 4832
Cited by:  Papers (5)
| | PDF (430 KB) | HTML

We investigate deletion correcting codes and restricted composition codes in particular. Restricted composition codes generalize codes on permutations and multipermutations. We use graph theoretic methods to characterize codes, establish bounds on code size, and describe constructions. The substring partial order has a well-known property. For any string, the number of superstrings of a particular... View full abstract»

• ### Multilevel Diversity Coding With Regeneration

Publication Year: 2016, Page(s):4833 - 4847
Cited by:  Papers (4)
| | PDF (1568 KB) | HTML

Digital contents distributed storage systems may have different reliability and access delay requirements, and erasure codes with different strengths can provide the best storage efficiency in these systems. At the same time, in such large-scale distributed storage systems, nodes fail on a regular basis, and the contents stored on them need to be regenerated from the data downloaded from the remai... View full abstract»

• ### Optimal Exact Repair Strategy for the Parity Nodes of the $(k+2,k)$ Zigzag Code

Publication Year: 2016, Page(s):4848 - 4856
Cited by:  Papers (3)
| | PDF (459 KB) | HTML

In this paper, we reinterpret the (k+2, k) zigzag code in coding matrix and then propose an optimal exact repair strategy for its parity nodes, whose repair disk I/O approaches a lower bound derived in this paper. View full abstract»

• ### Further Exploration of Convolutional Encoders for Unequal Error Protection and New UEP Convolutional Codes

Publication Year: 2016, Page(s):4857 - 4866
Cited by:  Papers (1)
| | PDF (2136 KB) | HTML

In this paper, the unequal error protection (UEP) capability of convolutional encoders, in terms of the separation vector, is studied from an algebraic viewpoint. A simple procedure is presented for constructing a generator matrix, which is basic and has the largest separation vector for every convolutional code. Such a generator matrix would be desirable, since the corresponding encoder not only ... View full abstract»

• ### One- and Two-Point Codes Over Kummer Extensions

Publication Year: 2016, Page(s):4867 - 4872
Cited by:  Papers (4)
| | PDF (196 KB) | HTML

We compute the Weierstrass semigroup at one totally ramified place for Kummer extensions defined by ym= f (x)λ, where f (x) is a separable polynomial over Fq. In addition, we compute the Weierstrass semigroup at two certain totally ramified places. We then apply our results to construct one- and two-point algebraic geometric codes with good parameters. View full abstract»

• ### A Simple Proof of Polarization and Polarization for Non-Stationary Memoryless Channels

Publication Year: 2016, Page(s):4873 - 4878
Cited by:  Papers (2)
| | PDF (252 KB) | HTML

We give a simple proof of Arıkan's polarization phenomenon that uses only elementary methods. Using the same method, we show that Arıkan's construction also polarizes non-stationary memoryless channels in the same way it polarizes the stationary memoryless channels. View full abstract»

• ### Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations

Publication Year: 2016, Page(s):4879 - 4909
Cited by:  Papers (9)
| | PDF (1280 KB) | HTML

The compute-and-forward framework permits each receiver in a Gaussian network to directly decode a linear combination of the transmitted messages. The resulting linear combinations can then be employed as an end-to-end communication strategy for relaying, interference alignment, and other applications. Recent efforts have demonstrated the advantages of employing unequal powers at the transmitters ... View full abstract»

• ### Two-User Erasure Interference Channels With Local Delayed CSIT

Publication Year: 2016, Page(s):4910 - 4923
Cited by:  Papers (3)
| | PDF (1423 KB) | HTML

We study the capacity region of two-user erasure interference channels with local delayed channel state information at the transmitters. In our model, transmitters have local mismatched outdated knowledge of the channel gains. We propose a transmission strategy that only relies on the delayed knowledge of the outgoing links at each transmitter and achieves the outer bound for the scenario in which... View full abstract»

• ### Projection Theorems for the Rényi Divergence on$\alpha$-Convex Sets

Publication Year: 2016, Page(s):4924 - 4935
Cited by:  Papers (1)
| | PDF (285 KB) | HTML

This paper studies forward and reverse projections for the Rényi divergence of order α E (0, ∞) on α-convex sets. The forward projection on such a set is motivated by some works of Tsallis et al. in statistical physics, and the reverse projection is motivated by robust statistics. In a recent work, van Erven and Harremoës proved a Pythagorean inequality for Rényi divergences on α-convex sets under... View full abstract»

• ### Multicoding Schemes for Interference Channels

Publication Year: 2016, Page(s):4936 - 4952
Cited by:  Papers (1)
| | PDF (1055 KB) | HTML

The best known inner bound for the two-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop a multicoding scheme to achieve the same rate region. A key advantage of the multicoding nature of the proposed coding scheme is that it can be naturally ext... View full abstract»

• ### Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach

Publication Year: 2016, Page(s):4953 - 4967
Cited by:  Papers (4)
| | PDF (307 KB) | HTML

This paper establishes that the strong converse holds for some classes of discrete memoryless multimessage multicast networks (DM-MMNs) whose corresponding cut-set bounds are tight, i.e., coincide with the corresponding sets of achievable rate tuples. Our strong converse result implies that for any DM-MMN of these classes, the average error probabilities of any sequence of codes operated at a rate... View full abstract»

• ### Capacity Results for Multicasting Nested Message Sets Over Combination Networks

Publication Year: 2016, Page(s):4968 - 4992
Cited by:  Papers (1)
| | PDF (1641 KB) | HTML

The problem of multicasting two nested messages is studied over a class of networks known as combination networks. A source multicasts two messages, a common and a private message, to several receivers. A subset of the receivers (called the public receivers) only demand the common message, and the rest of the receivers (called the private receivers) demand both the common and the private message. ... View full abstract»

• ### The Two-User Causal Cognitive Interference Channel: Novel Outer Bounds and Constant Gap Result for the Symmetric Gaussian Noise Channel in Weak Interference

Publication Year: 2016, Page(s):4993 - 5017
| | PDF (1495 KB) | HTML

This paper studies the two-user causal cognitive interference channel (CCIC), where two transmitters aim to communicate independent messages to two different receivers via a common channel. One source, referred to as the cognitive, is capable of overhearing the other source, referred to as the primary, through a noisy in-band link and thus can assist in sending the primary's data. The authors of t... View full abstract»

• ### On the Relation Between Identifiability, Differential Privacy, and Mutual-Information Privacy

Publication Year: 2016, Page(s):5018 - 5029
Cited by:  Papers (9)
| | PDF (632 KB) | HTML

This paper investigates the relation between three different notions of privacy: identifiability, differential privacy, and mutual-information privacy. Under a unified privacydistortion framework, where the distortion is defined to be the expected Hamming distance between the input and output databases, we establish some fundamental connections between these three privacy notions. Given a maximum ... View full abstract»

• ### Power Optimization in Random Wireless Networks

Publication Year: 2016, Page(s):5030 - 5058
| | PDF (1615 KB) | HTML

In this paper, we analyze the problem of power control in large, random wireless networks that are obtained by “erasing” a finite fraction of nodes from a regular d-dimensional lattice of N transmit-receive pairs. In this model, which has the important feature of a minimum distance between transmitter nodes, we find that when the network is infinite, power control is always feasible below a positi... View full abstract»

• ### A Framework for Joint Design of Pilot Sequence and Linear Precoder

Publication Year: 2016, Page(s):5059 - 5079
| | PDF (1337 KB) | HTML

Most performance measures of pilot-assisted multiple-input multiple-output systems are functions of the linear precoder and the pilot sequence. A framework for the optimization of these two parameters is proposed, based on a matrix-valued generalization of the concept of effective signal-to-noise ratio (SNR) introduced in the famous work by Hassibi and Hochwald. Our framework aims to extend the wo... View full abstract»

• ### Rate-Distortion Function for a Heegard-Berger Problem With Two Sources and Degraded Reconstruction Sets

Publication Year: 2016, Page(s):5080 - 5092
Cited by:  Papers (3)
| | PDF (662 KB) | HTML

In this paper, we investigate an instance of the Heegard-Berger problem with two sources and arbitrarily correlated side information sequences at two decoders, in which the reconstruction sets at the decoders are degraded. Specifically, two sources are to be encoded in a manner that one of the two is reproduced losslessly by both the decoders, and the other is reproduced within some prescribed dis... View full abstract»

• ### Multi-Class Source-Channel Coding

Publication Year: 2016, Page(s):5093 - 5104
Cited by:  Papers (2)
| | PDF (848 KB) | HTML

This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the class index. The code performance is analyzed by means of random-coding error exponents and validated by simulation of a low-complexity implementation using existing source and channel codes. While each class code can be s... View full abstract»

• ### Volume of Metric Balls in High-Dimensional Complex Grassmann Manifolds

Publication Year: 2016, Page(s):5105 - 5116
Cited by:  Papers (3)
| | PDF (827 KB) | HTML

Volume of metric balls relates to rate-distortion theory and packing bounds on codes. In this paper, the volume of balls in complex Grassmann manifolds is evaluated for an arbitrary radius. The ball is defined as a set of hyperplanes of a fixed dimension with reference to a center of possibly different dimensions, and a generalized chordal distance for unequal dimensional subspaces is used. First,... View full abstract»

• ### From Denoising to Compressed Sensing

Publication Year: 2016, Page(s):5117 - 5144
Cited by:  Papers (50)
| | PDF (2753 KB) | HTML

A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several decades, and as a result, todays denoisers can effectively remove large amounts of additive white Gaussian noise. A compressed sensing (CS) reconstruction algorithm seeks to recover a structured signal acquired using a small number of randomiz... 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