# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 36

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

Publication Year: 2015, Page(s): C2
| |PDF (141 KB)
• ### Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding

Publication Year: 2015, Page(s):701 - 707
Cited by:  Papers (3)
| |PDF (396 KB) | HTML

Tight bounds for several symmetric divergence measures are derived in terms of the total variation distance. It is shown that each of these bounds is attained by a pair of two- or three-element probability distributions. An application of these bounds for lossless source coding is provided, refining and improving a certain bound by Csiszár. Another application of these bounds has been rece... View full abstract»

• ### Entropy Power Inequality for the Rényi Entropy

Publication Year: 2015, Page(s):708 - 714
Cited by:  Papers (16)
| |PDF (191 KB) | HTML

The classical entropy power inequality is extended to the Rényi entropy. We also discuss the question of the existence of the entropy for sums of independent random variables. View full abstract»

• ### Dilworth Rate: A Generalization of Witsenhausen’s Zero-Error Rate for Directed Graphs

Publication Year: 2015, Page(s):715 - 726
| |PDF (475 KB) | HTML

We investigate a communication setup where a source output is sent through a free noisy channel first and an additional codeword is sent through a noiseless, but expensive channel later. With the help of the second message the decoder should be able to decide with zero-error whether its decoding of the first message was error-free. This scenario leads to the definition of a digraph parameter that ... View full abstract»

• ### On Achievable Rates and Error Exponents for Channels With Mismatched Decoding

Publication Year: 2015, Page(s):727 - 740
Cited by:  Papers (9)
| |PDF (300 KB) | HTML

The problem of characterizing achievable rates and error exponents for discrete memoryless channels with mismatched decoding is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods: 1) superposition coding and 2) random binning. The inner bounds are derived by analyzing the average error... View full abstract»

• ### On Zero-Rate Error Exponents of Finite-State Channels With Input-Dependent States

Publication Year: 2015, Page(s):741 - 750
Cited by:  Papers (4)
| |PDF (240 KB) | HTML

We derive a single-letter formula for the zero-rate reliability (error exponent) of a finite-state channel whose state variable depends deterministically (and recursively) on past channel inputs, where the code complies with a given channel input constraint. Special attention is then devoted to the important special case of the Gaussian channel with intersymbol interference, where more explicit re... View full abstract»

• ### A Generalization of Peres’s Algorithm for Generating Random Bits From Loaded Dice

Publication Year: 2015, Page(s):751 - 757
Cited by:  Papers (1)
| |PDF (338 KB) | HTML

Peres's algorithm produces unbiased random bits from biased coin tosses, recursively, using the famous von Neumann's method as its base. The algorithm is simple and elegant, but, at first glance, appears to work almost like magic and its generalization is elusive. We generalize the method to generate unbiased random bits from loaded dice, i.e., many-valued Bernoulli source. The generalization is a... View full abstract»

• ### Polar Codes for Broadcast Channels

Publication Year: 2015, Page(s):758 - 782
Cited by:  Papers (15)
| |PDF (1491 KB) | HTML

Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from m-independent messages to one codeword while satisfying broadcast constraints. The polarization-based codes achieve rates on the boundary of the private-message capacity region. For two-user noisy broadcast channels, p... View full abstract»

• ### Achieving Marton’s Region for Broadcast Channels Using Polar Codes

Publication Year: 2015, Page(s):783 - 800
Cited by:  Papers (16)
| |PDF (1023 KB) | HTML

This paper presents polar coding schemes for the two-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is tight for all classes of two-user DM-BCs whose capacity regions are known. To accomplish this task, we first construct polar codes for both the superposition as w... View full abstract»

• ### On the Covering Radius of MDS Codes

Publication Year: 2015, Page(s):801 - 811
Cited by:  Papers (2)
| |PDF (548 KB) | HTML

For a linear maximum distance separable (MDS) code with redundancy r, the covering radius is either r or r -1. However, for r > 3, few examples of q-ary linear MDS codes with radius r -1 are known, including the Reed-Solomon codes with length q + 1. In this paper, for redundancies r as large as 12√q, infinite families of q-ary MDS codes with covering radius r - 1 and length less than q +... View full abstract»

• ### Complexity of Dependences in Bounded Domains, Armstrong Codes, and Generalizations

Publication Year: 2015, Page(s):812 - 819
| |PDF (359 KB) | HTML

The study of Armstrong codes is motivated by the problem of understanding complexities of dependences in relational database systems, where attributes have bounded domains. A (q, k, n)-Armstrong code is a q-ary code of length n with minimum Hamming distance n - k + 1, and for any set of k - 1 coordinates, there exist two codewords that agree exactly there. Let f (q, k) be the maximum n for which s... View full abstract»

• ### On the List-Decodability of Random Self-Orthogonal Codes

Publication Year: 2015, Page(s):820 - 828
Cited by:  Papers (1)
| |PDF (233 KB) | HTML

Guruswami et al. showed that the list-decodability of random linear codes is as good as that of general random codes. In this paper, we further strengthen the result by showing that the list-decodability of random Euclidean self-orthogonal codes is as good as that of general random codes as well, i.e., achieves the classical Gilbert-Varshamov bound. In particular, we show that, for any fixed finit... View full abstract»

• ### Gray Code for Row-Reduced Echelon Forms Over the Binary Field

Publication Year: 2015, Page(s):829 - 835
| |PDF (190 KB) | HTML

We visit generator matrices A0,A1,A2,··· of all k-dimensional subspaces of the n-dimensional vector space over the field with two elements such that two consecutive matrices Ai and Ai+1 differ in exactly one bit. View full abstract»

• ### A Matroidal Framework for Network-Error Correcting Codes

Publication Year: 2015, Page(s):836 - 872
Cited by:  Papers (4)
| |PDF (2708 KB) | HTML

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. A particularly interesting feature of this development is the ability to construct (scalar and vector) linearly solvable networks using certain classes of... View full abstract»

• ### A Unified Form of Exact-MSR Codes via Product-Matrix Frameworks

Publication Year: 2015, Page(s):873 - 886
Cited by:  Papers (7)
| |PDF (551 KB) | HTML

Regenerating codes represent a class of block codes applicable for distributed storage systems. The [n, k, d] regenerating code has data recovery capability while possessing arbitrary k out of n code fragments, and supports the capability for code fragment regeneration through the use of other arbitrary d fragments, for k ≤ d ≤ n - 1. Minimum storage regenerating (MSR) codes are a su... View full abstract»

• ### Classification of the $Z_{2}Z_{4}$ -Linear Hadamard Codes and Their Automorphism Groups

Publication Year: 2015, Page(s):887 - 894
Cited by:  Papers (4)
| |PDF (233 KB) | HTML

A Z2Z4-linear Hadamard code of length α + 2β = 2t is a binary Hadamard code, which is the Gray map image of a Z2Z4-additive code with α binary coordinates and β quaternary coordinates. It is known that there are exactly ⌊t-1/2⌋ and ⌊t/2⌋ nonequivalent Z2Z4-linear Had... View full abstract»

• ### Information Friction and Its Implications on Minimum Energy Required for Communication

Publication Year: 2015, Page(s):895 - 907
Cited by:  Papers (14)
| |PDF (730 KB) | HTML

Just as there are frictional losses associated with moving masses on a surface, what if there were frictional losses associated with moving information on a substrate? Indeed, many modes of communication suffer from such frictional losses. We propose to model these losses as proportional to “bit-meters,” i.e., the product of “mass” of information (i.e., the number of bi... View full abstract»

• ### Lattice Structures of Precoders Maximizing the Minimum Distance in Linear Channels

Publication Year: 2015, Page(s):908 - 916
Cited by:  Papers (3)
| |PDF (2498 KB) | HTML

This paper investigates linear precoding over nonsingular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is subject to an energy constraint. It is shown that the optimal precoder only produces a finite number of different lattices, namely perfect lattices, at the receiver. ... View full abstract»

• ### Interference Networks With no CSIT: Impact of Topology

Publication Year: 2015, Page(s):917 - 938
Cited by:  Papers (15)
| |PDF (1643 KB) | HTML

We consider partially connected K -user interference networks, where the transmitters have no knowledge about the channel gain values, but they are aware of network topology. We introduce several linear algebraic and graph theoretic concepts to derive new topology-based outer bounds and inner bounds on the symmetric degrees-of-freedom of these networks. We evaluate our bounds for two classes of ne... View full abstract»

• ### The Approximate Capacity Region of the Gaussian Y-Channel via the Deterministic Approach

Publication Year: 2015, Page(s):939 - 962
Cited by:  Papers (8)
| |PDF (1212 KB) | HTML

A full-duplex wireless network with three users that want to establish full message exchange via a relay is considered. Thus, this network which is known as the Y-channel has a total of six messages, two outgoing, and two incoming at each user. The users are not physically connected, and thus the relay is essential for their communication. The deterministic Y-channel is considered first, its capac... View full abstract»

• ### Diversity-Multiplexing Tradeoff for the Interference Channel With a Relay

Publication Year: 2015, Page(s):963 - 982
Cited by:  Papers (4)
| |PDF (696 KB) | HTML

We study the diversity-multiplexing tradeoff (DMT) for the slow fading interference channel with a relay (ICR). We derive four inner bounds on the DMT region: the first is based on the compress-and-forward (CF) relaying scheme, the second is based on the decode-and-forward (DF) relaying scheme, and the last two bounds are based on the half-duplex (HD) and full-duplex (FD) amplify-and-forward (AF) ... View full abstract»

• ### The Optimal Use of Rate-Limited Randomness in Broadcast Channels With Confidential Messages

Publication Year: 2015, Page(s):983 - 995
Cited by:  Papers (2)
| |PDF (419 KB) | HTML

In coding schemes for the wire-tap channel or for broadcast channels with confidential messages, it is well-known that the sender needs to use stochastic encoding to avoid information about the transmitted confidential message from being leaked to an eavesdropper. In this paper, we investigate the tradeoff between the rate of random numbers needed to realize the stochastic encoding and the rates o... View full abstract»

• ### Anonymity of Memory-Limited Chaum Mixes Under Timing Analysis: An Information Theoretic Perspective

Publication Year: 2015, Page(s):996 - 1009
Cited by:  Papers (4)
| |PDF (734 KB) | HTML

Anonymous communication, where users communicate without revealing the identities of communicating parties or the paths of data flow is critical in data networks. On the Internet, Chaum mixes, intermediate nodes, or proxy servers, which use layered encryption and packet shuffling methods to hide source identities, are used to provide anonymity to network users. In this paper, an information theore... View full abstract»

• ### Partition Information and its Transmission Over Boolean Multi-Access Channels

Publication Year: 2015, Page(s):1010 - 1027
Cited by:  Papers (4)
| |PDF (1190 KB) | HTML

In this paper, we propose a novel reservation system to study partition information and its transmission over a noise-free Boolean multiaccess channel. The objective of transmission is not to restore the message, but to partition active users into distinct groups so that they can, subsequently, transmit their messages without collision. We first calculate (by mutual information) the amount of info... 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