# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 50

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

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

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

Publication Year: 2015, Page(s): 2
| PDF (711 KB) | HTML
• ### Polar Codes: Speed of Polarization and Polynomial Gap to Capacity

Publication Year: 2015, Page(s):3 - 16
Cited by:  Papers (11)
| | PDF (303 KB) | HTML

We prove that, for all binary-input symmetric memoryless channels, polar codes enable reliable communication at rates within an additive gap ε > 0 to the Shannon capacity with a block length, construction complexity, and decoding complexity, all bounded by a polynomial in 1/ε. Polar coding gives the first known explicit construction with rigorous proofs of all these properties; pr... View full abstract»

• ### Systematic Error-Correcting Codes for Rank Modulation

Publication Year: 2015, Page(s):17 - 32
Cited by:  Papers (15)
| | PDF (536 KB) | HTML

The rank-modulation scheme has been recently proposed for efficiently storing data in nonvolatile memories. In this paper, we explore [n, k, d] systematic error-correcting codes for rank modulation. Such codes have length n, k information symbols, and minimum distance d. Systematic codes have the benefits of enabling efficient information retrieval in conjunction with memory-scrubbing schemes. We ... View full abstract»

• ### Group Coding With Complex Isometries

Publication Year: 2015, Page(s):33 - 50
| | PDF (784 KB) | HTML

We investigate group coding for arbitrary finite groups acting linearly on vector spaces. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using geometric notions of minimal length coset representatives. The infinite family of complex reflection groups G(r, 1, n) produces effective codes of arbitrarily large ... View full abstract»

• ### On List-Decodability of Random Rank Metric Codes and Subspace Codes

Publication Year: 2015, Page(s):51 - 59
Cited by:  Papers (5)
| | PDF (279 KB) | HTML

Codes in rank metric have a wide range of applications. To construct such codes with better list-decoding performance explicitly, it is of interest to investigate the listdecodability of random rank metric codes. It is shown that if n/m = b is a constant, then for every rank metric code in Fm×n q with rate R and list-decoding radius ρ must obey the Gilbert-Varshamov bound, that is, R... View full abstract»

• ### New Binary Codes From Rational Function Fields

Publication Year: 2015, Page(s):60 - 65
Cited by:  Papers (1)
| | PDF (1509 KB) | HTML

In this paper, we present an algebraic construction of binary codes through rational function fields. We make use of certain multiplicative group of rational functions for our construction. In particular, the point at infinity can be employed in our construction to get codes of length up to q+1, where q is the ground field size. As a result, several new binary constant-weight codes are found and m... View full abstract»

• ### A Characterization of Two-Weight Projective Cyclic Codes

Publication Year: 2015, Page(s):66 - 71
Cited by:  Papers (3)
| | PDF (192 KB) | HTML

We give necessary conditions for a two-weight projective cyclic code to be the direct sum of two one-weight irreducible cyclic subcodes of the same dimension, following the work of Wolfmann and Vega. This confirms Vega's conjecture that all the two-weight cyclic codes of this type are the known ones in the projective case. View full abstract»

• ### Extremal Type I $\mathbb {Z}_{k}$ -Codes and $k$ -Frames of Odd Unimodular Lattices

Publication Year: 2015, Page(s):72 - 81
Cited by:  Papers (1)
| | PDF (1483 KB) | HTML

For some extremal (optimal) odd unimodular lattice L in dimensions 12, 16, 20, 28, 32, 36, 40, and 44, we determine all integers k such that L contains a k-frame. This result yields the existence of an extremal Type I Zk-code of lengths 12, 16, 20, 32, 36, 40, and 44, and a near-extremal Type I Zk-code of length 28 for positive integers k with only a few exceptions. View full abstract»

• ### Thresholds of Random Quasi-Abelian Codes

Publication Year: 2015, Page(s):82 - 90
Cited by:  Papers (4)
| | PDF (235 KB) | HTML

For a q-ary random quasi-Abelian code with fixed coindex and constant rate r, it is shown that the Gilbert-Varshamov (GV)-bound is a threshold point: if r is less than the GV-bound at δ ∈ (0, 1 - q-1), then the probability of the relative distance of the random code being greater than δ approaches 1 as the index goes to infinity; whereas, if r is bigger than the GV-... View full abstract»

• ### Randomized Quantization and Source Coding With Constrained Output Distribution

Publication Year: 2015, Page(s):91 - 106
Cited by:  Papers (2)
| | PDF (446 KB) | HTML

This paper studies fixed-rate randomized vector quantization under the constraint that the quantizer's output has a given fixed probability distribution. A general representation of randomized quantizers that includes the common models in the literature is introduced via appropriate mixtures of joint probability measures on the product of the source and reproduction alphabets. Using this represent... View full abstract»

• ### Polar Codes for Multiple Descriptions

Publication Year: 2015, Page(s):107 - 119
Cited by:  Papers (1)
| | PDF (546 KB) | HTML

A polar coding scheme is proposed for the multiple description coding (MDC) problem and is shown to be able to achieve a certain rate pair on the dominant line of the achievable rate region determined by El Gamal and Cover. This scheme is an adaptation of the one developed by ŗaşoğlu et al. for the multiple access channel (MAC) to the MDC setting. The analysis of the propos... View full abstract»

• ### On Match Lengths, Zero Entropy, and Large Deviations—With Application to Sliding Window Lempel–Ziv Algorithm

Publication Year: 2015, Page(s):120 - 132
Cited by:  Papers (1)
| | PDF (279 KB) | HTML

The sliding window Lempel-Ziv (SWLZ) algorithm that makes use of recurrence times and match lengths has been studied from various perspectives in information theory literature. In this paper, we undertake a finer study of these quantities under two different scenarios: 1) zero entropy sources that are characterized by strong long-term memory and 2) the processes with weak memory as described throu... View full abstract»

• ### Optimal Coding for Streaming Authentication and Interactive Communication

Publication Year: 2015, Page(s):133 - 145
Cited by:  Papers (7)
| | PDF (681 KB) | HTML

We consider the task of communicating a data stream-a long, possibly infinite message not known in advance to the sender-over a channel with adversarial noise. For any given noise rate c <; 1, we show an efficient, constant-rate scheme that correctly decodes a (1 - c) fraction of the stream sent so far with high probability, or aborts if the noise rate exceeds c. In addition, we prove that no c... View full abstract»

• ### Upper Bounds on the Capacity of Deletion Channels Using Channel Fragmentation

Publication Year: 2015, Page(s):146 - 156
| | PDF (795 KB) | HTML

We study memoryless channels with synchronization errors as defined by a stochastic channel matrix allowing for symbol drop-outs or symbol insertions with particular emphasis on the binary and non-binary deletion channels. We offer a different look at these channels by considering equivalent models by fragmenting the input sequence where different subsequences travel through different channels. Th... View full abstract»

• ### Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel

Publication Year: 2015, Page(s):157 - 172
Cited by:  Papers (8)
| | PDF (680 KB) | HTML

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel (MAC) with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's combinatorial central limit theorem, an inner bound on the set of locally achievable second-order coding rates is given for each point on the bounda... View full abstract»

• ### MAC With Action-Dependent State Information at One Encoder

Publication Year: 2015, Page(s):173 - 188
Cited by:  Papers (5)
| | PDF (1585 KB) | HTML

The growing interest in action-dependent channels motivates us to extend the study of action-dependent settings, which until now focused on point-to-point models, to multiple-access channels (MACs). In this paper, we consider a two-user, state-dependent MAC, in which one of the encoders, called the informed (cognitive) encoder, is allowed to take an action that affects the formation of the channel... View full abstract»

• ### Mixed Noisy Network Coding and Cooperative Unicasting in Wireless Networks

Publication Year: 2015, Page(s):189 - 222
Cited by:  Papers (3)
| | PDF (2378 KB) | HTML

The problem of communicating a single message to a destination in presence of multiple relay nodes, referred to as cooperative unicast network, is considered. First, we introduce mixed noisy network coding (MNNC) scheme which generalizes noisy network coding where relays are allowed to decode-and-forward (DF) messages while all of them (without exception) transmit noisy descriptions of their obser... View full abstract»

• ### On the Capacity Bounds for Poisson Interference Channels

Publication Year: 2015, Page(s):223 - 238
Cited by:  Papers (3)
| | PDF (1323 KB) | HTML

The Poisson interference channel, which models optical communication systems with multiple transceivers in the short-noise-limited regime, is investigated. Conditions for the strong interference regime are characterized and the corresponding capacity region is derived, which is the same as that of the compound Poisson multiple-access channel with each receiver decoding both messages. For the cases... View full abstract»

• ### Interference Alignment Using Finite and Dependent Channel Extensions: The Single Beam Case

Publication Year: 2015, Page(s):239 - 255
Cited by:  Papers (4)
| | PDF (348 KB) | HTML

Vector space interference alignment (IA) is known to achieve high degrees of freedom (DoFs) with infiniteindependent channel extensions, but its performance is largely unknown for a finite number of possibly dependent channel extensions. In this paper, we consider a K-user Mt x Mr MIMO interference channel (IC) with an arbitrary number of channel extensions T and arbitrary channel diversity order ... View full abstract»

• ### Information Dimension and the Degrees of Freedom of the Interference Channel

Publication Year: 2015, Page(s):256 - 279
Cited by:  Papers (11)
| | PDF (515 KB) | HTML

The degrees of freedom (DoFs) of the K -user Gaussian interference channel determine the asymptotic growth of the maximal sum rate as a function of the signal-to-noise ratio. Subject to a very general sufficient condition on the cross-channel gains, we give a formula for the DoFs of the scalar interference channel as a function of the deterministic channel matrix, which involves maximization of a ... View full abstract»

• ### Bounds and Capacity Theorems for Cognitive Interference Channels With State

Publication Year: 2015, Page(s):280 - 304
Cited by:  Papers (8)
| | PDF (772 KB) | HTML

A class of cognitive interference channels with state are investigated, in which a primary transmitter sends a message to two receivers (receivers 1 and 2) with assistance of a cognitive transmitter (that knows the primary transmitter's message), and the cognitive transmitter also sends a separate message to receiver 2. The channel is corrupted by an independent and identically distributed state s... View full abstract»

• ### An Alternative to Decoding Interference or Treating Interference as Gaussian Noise

Publication Year: 2015, Page(s):305 - 322
Cited by:  Papers (6)
| | PDF (885 KB) | HTML

This paper addresses the following question regarding Gaussian networks: Is there an alternative to decoding interference or treating interference as Gaussian noise? To state our result, we study a decentralized network of one primary user (PU) and one secondary user (SU) modeled by a two-user Gaussian interference channel. In one scenario, the primary transmitter is constellation-based and PUs co... 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