# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 46

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

Publication Year: 2015, Page(s): C2
| PDF (140 KB)
• ### Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes

Publication Year: 2015, Page(s):5765 - 5778
Cited by:  Papers (4)
| | PDF (757 KB) | HTML

This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable ... View full abstract»

• ### A Systematic Piggybacking Design for Minimum Storage Regenerating Codes

Publication Year: 2015, Page(s):5779 - 5786
Cited by:  Papers (2)
| | PDF (840 KB) | HTML

Piggybacking is an efficient method to decrease the repair bandwidth of maximum distance separable codes. In this paper, in order to reduce the repair bandwidth of parity nodes of the known minimum storage regenerating (MSR) codes with high rate, which is usually the whole amount of the original data, i.e., the maximal, a new systematic piggybacking design is proposed through an in-depth analysis ... View full abstract»

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

Publication Year: 2015, Page(s):5787 - 5794
Cited by:  Papers (27)
| | PDF (451 KB) | HTML

In a locally recoverable or repairable code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage nodes... View full abstract»

• ### Reliability of Erasure Coded Storage Systems: A Combinatorial-Geometric Approach

Publication Year: 2015, Page(s):5795 - 5809
| | PDF (1342 KB) | HTML

We consider the probability of data loss, or equivalently, the reliability function for an erasure coded distributed data storage system under worst case conditions. Data loss in an erasure coded system depends on probability distributions for the disk repair duration and the disk failure duration. In previous works, the data loss probability of such systems has been studied under the assumption o... View full abstract»

• ### Storage Capacity of Repairable Networks

Publication Year: 2015, Page(s):5810 - 5821
Cited by:  Papers (5)
| | PDF (721 KB) | HTML

In this paper, we introduce a model of a distributed storage system that is locally recoverable from any single server failure. Unlike the usual local recovery model of codes for distributed storage, this model accounts for the fact that each server or storage node in a network is connectable to only some, and not all other, nodes. This may happen for reasons such as physical separation, inhomogen... View full abstract»

• ### Probabilistic Existence Results for Separable Codes

Publication Year: 2015, Page(s):5822 - 5827
Cited by:  Papers (3)
| | PDF (193 KB) | HTML

Separable codes were defined by Cheng and Miao in 2011, motivated by applications to the identification of pirates in a multimedia setting. Combinatorially, t̅-separable codes lie somewhere between t-frameproof and (t - 1)-frameproof codes: all t-frameproof codes are t̅-separable, and all t̅-separable codes are (t - 1)-frameproof. Results for frameproof codes show that (when q... View full abstract»

• ### A Construction of New MDS Symbol-Pair Codes

Publication Year: 2015, Page(s):5828 - 5834
Cited by:  Papers (4)
| | PDF (203 KB) | HTML

Recently, symbol-pair codes are proposed to protect against pair errors in symbol-pair read channels. One main task in symbol-pair coding theory is to design codes with large minimum pair distance. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense they attain maximal minimum pair distance. In this paper, based on constacyclic codes, we construct some new MDS symbol-pair c... View full abstract»

• ### A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing

Publication Year: 2015, Page(s):5835 - 5842
Cited by:  Papers (42)
| | PDF (454 KB) | HTML

In this paper, a class of two-weight and three-weight linear codes over GF(p) is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain bounds on linear codes. These codes have applications also in authentication codes, association schemes, and strongly regular graphs, in addition to their applications... View full abstract»

• ### Decoding of Dual-Containing Codes From Hermitian Tower and Applications

Publication Year: 2015, Page(s):5843 - 5847
| | PDF (249 KB) | HTML

In this paper, we study the decoding of dual-containing codes from Hermitian tower and applications to quantum codes. The contribution of this paper is threefold. First, we construct the quantum stabilizer codes from the Hermitian tower. Second, we provide a deterministic decoding algorithm with decoding radius that almost achieves the optimal decoding radius, i.e., (1-R)/4 , where R is the rate. ... View full abstract»

• ### A Family of $(k+1)$ -Ary Signature Codes for Noisy Multiple-Access Adder Channel

Publication Year: 2015, Page(s):5848 - 5853
| | PDF (359 KB) | HTML

A coding scheme of (k+1) -ary error-correcting signature codes for a noisy multiple-access adder channel is proposed. Given a signature matrix A and a difference matrix D=D+ - D- a priori, a larger signature matrix is obtained by replacing each element in the Hadamard matrix with A , or D+ , or D- depending on the values of the elements and their locatio... View full abstract»

• ### Asynchronous Transmission Over Single-User State-Dependent Channels

Publication Year: 2015, Page(s):5854 - 5867
Cited by:  Papers (1)
| | PDF (804 KB) | HTML

Several channels with asynchronous side information are introduced. We first consider single-user state-dependent channels with asynchronous side information at the transmitter. It is assumed that the state information sequence is a possibly delayed version of the state sequence, and that the encoder and the decoder are aware of the fact that the state information might be delayed. It is additiona... View full abstract»

• ### Rescaling Entropy and Divergence Rates

Publication Year: 2015, Page(s):5868 - 5882
Cited by:  Papers (1)
| | PDF (525 KB) | HTML

Based on rescaling by some suitable sequence instead of the number of time units, the usual notion of divergence rate is here extended to define and determine meaningful generalized divergence rates. Rescaling entropy rates appears as a special case. Suitable rescaling is naturally induced by the asymptotic behavior of the marginal divergences. Closed-form formulas are obtained as soon as the marg... View full abstract»

• ### Minimum MS. E. Gerber’s Lemma

Publication Year: 2015, Page(s):5883 - 5891
Cited by:  Papers (1)
| | PDF (534 KB) | HTML

Mrs. Gerber's Lemma lower bounds the entropy at the output of a binary symmetric channel in terms of the entropy of the input process. In this paper, we lower bound the output entropy via a different measure of input uncertainty, pertaining to the minimum mean squared error prediction cost of the input process. We show that in many cases our bound is tighter than the one obtained from Mrs. Gerber'... View full abstract»

• ### Higher Order Derivatives in Costa’s Entropy Power Inequality

Publication Year: 2015, Page(s):5892 - 5905
Cited by:  Papers (2)
| | PDF (325 KB) | HTML

Let X be an arbitrary continuous random variable and Z be an independent Gaussian random variable with zero mean and unit variance. For t > 0, Costa proved that e2h(X+√t Z) is concave in t, where the proof hinged on the first and second order derivatives of h(X + √t Z). In particular, these two derivatives are signed, i.e., (∂/∂t)h(X + √tZ) ≥... View full abstract»

• ### On Capacity Formulation With Stationary Inputs and Application to a Bit-Patterned Media Recording Channel Model

Publication Year: 2015, Page(s):5906 - 5930
| | PDF (2169 KB) | HTML

In this correspondence, we illustrate among other things the use of the stationarity property of the set of capacity-achieving inputs in capacity calculations. In particular, as a case study, we consider a bit-patterned media recording channel model and formulate new lower and upper bounds on its capacity that yield improvements over existing results. Inspired by the observation that the new bound... View full abstract»

• ### An Error Event Sensitive Tradeoff Between Rate and Coding Gain in MIMO MAC

Publication Year: 2015, Page(s):5931 - 5947
| | PDF (696 KB) | HTML

This paper investigates the design of codes for multiple-input multiple-output (MIMO) multiple access channel (MAC). If a joint maximum-likelihood decoding is to be performed at the receiver, then every MIMO-MAC code can be regarded as a single-user code, where the minimum determinant criterion proposed by Tarokh et al. is useful for designing such codes and for upper bounding the maximum pairwise... View full abstract»

• ### Selection and Rate-Adaptation Schemes for MIMO Multiple-Access Channels With Low-Rate Channel Feedback

Publication Year: 2015, Page(s):5948 - 5975
Cited by:  Papers (3)
| | PDF (1954 KB) | HTML

In this paper, two selection schemes are proposed for coded transmission over multiple-input multiple-output (MIMO) multiple-access channels (MAC) to yield a much higher diversity-multiplexing gain tradeoff (DMT) performance. These schemes require a channel feedback, but at an extremely low rate. The first scheme is based on user selection and can be easily implemented in the existing MIMO-MAC sys... View full abstract»

• ### MIMO MAC-BC Duality With Linear-Feedback Coding Schemes

Publication Year: 2015, Page(s):5976 - 5998
Cited by:  Papers (6)
| | PDF (1297 KB) | HTML

We show that the rate regions achieved by linear-feedback coding schemes over dual multi-antenna Gaussian multi-access channels (MACs) and broadcast channels (BCs) with independent noises coincide. By dual here we mean: (1) the channel matrices of the MAC and the BC are transposes of each other and (2) the same total input-power constraint P is imposed on both the channels. We also present multi-l... View full abstract»

• ### On Vector Perturbation Precoding for the MIMO Gaussian Broadcast Channel

Publication Year: 2015, Page(s):5999 - 6027
| | PDF (1855 KB) | HTML

Precoding schemes in the framework of vector perturbation (VP) for the multiple-input multiple-output (MIMO) Gaussian broadcast channel (GBC) are investigated. The VP scheme, originally a “one-shot” technique, is generalized to encompass processing over multiple time instances. Using lattice-based extended alphabets (“perturbations”), and considering the infinite time-s... View full abstract»

• ### On the Number of Interference Alignment Solutions for the $K$ -User MIMO Channel With Constant Coefficients

Publication Year: 2015, Page(s):6028 - 6048
Cited by:  Papers (3)
| | PDF (1270 KB) | HTML

In this paper, we study the number of different interference alignment (IA) solutions in a K-user multiple-input multiple-output (MIMO) interference channel, when the alignment is performed via beamforming and no symbol extensions are allowed. We focus on the case where the number of IA equations matches the number of variables. In this situation, the number of IA solutions is finite and constant ... View full abstract»

• ### The Gaussian Multiple Access Diamond Channel

Publication Year: 2015, Page(s):6049 - 6059
Cited by:  Papers (7)
| | PDF (813 KB) | HTML

In this paper, we study the capacity of the diamond channel. We focus on the special case where the channel between the source node and the two relay nodes are two separate links with finite capacities and the link from the two relay nodes to the destination node is a Gaussian multiple access channel. We call this model the Gaussian multiple access diamond channel. We first propose an upper bound ... View full abstract»

• ### On the Capacity Regions of Two-Way Diamond Channels

Publication Year: 2015, Page(s):6060 - 6090
Cited by:  Papers (1)
| | PDF (7372 KB) | HTML

In this paper, we study the capacity regions of two-way diamond channels. We show that for a linear deterministic model the capacity of the diamond channel in each direction can be simultaneously achieved for all values of channel parameters, where the forward and backward channel parameters are not necessarily the same. We divide the achievability scheme into three cases, depending on the forward... View full abstract»

• ### Deterministic-Coding Capacity of Networks in the Low-Power Regime

Publication Year: 2015, Page(s):6091 - 6106
| | PDF (627 KB) | HTML

The deterministic-coding capacity of a network is the capacity of a network when nodes are restricted to transmitting reliable information, that is, (asymptotically) deterministic functions of the source messages. This is a generalization of network coding to wireless networks. The main contribution of this paper is to develop new outer bounds on the deterministic-coding capacity in the low-power ... 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