# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 61

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

Publication Year: 2016, Page(s): C2
| PDF (118 KB)
• ### Optimal Locally Repairable Codes and Connections to Matroid Theory

Publication Year: 2016, Page(s):6661 - 6671
Cited by:  Papers (1)
| | PDF (531 KB) | HTML

Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency. Classical codes, such as Reed-Solomon (RS), are highly sub-optimal for distributed environments due to their high overhead during single-failure events. Locally repairable codes (LRCs) form a new family of codes that are repair efficient. In particular, LRCs minimize the nu... View full abstract»

• ### High-Rate Locally Correctable Codes via Lifting

Publication Year: 2016, Page(s):6672 - 6682
| | PDF (296 KB) | HTML

We present a general framework for constructing high-rate error correcting codes that are locally correctable (and hence locally decodable if linear) with a sublinear number of queries, based on lifting codes with respect to functions on the coordinates. Our approach generalizes the lifting of affine-invariant codes (of Guo, Kopparty, and Sudan) and its generalization automorphic lifting (alluded ... View full abstract»

• ### Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes

Publication Year: 2016, Page(s):6683 - 6697
| | PDF (1077 KB) | HTML

The exact-repair regenerating codes for distributed storage system are studied in this work. A novel coding scheme is proposed for code construction for any (n, k, d = k) system. It is shown that the proposed codes are optimum, in the sense that any operating point satisfying the lower bound for the storage-bandwidth trade-off can be achieved with the proposed construction. As a consequence, the o... View full abstract»

• ### Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors

Publication Year: 2016, Page(s):6698 - 6712
| | PDF (625 KB) | HTML

Consider the transmission of a polar code of block length N and rate R over a binary memoryless symmetric channel W and let Pe be the block error probability under successive cancellation decoding. In this paper, we develop new bounds that characterize the relationship of the parameters R, N, Pe, and the quality of the channel W quantified by its capacity I(W) and its Bhattac... View full abstract»

• ### New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes

Publication Year: 2016, Page(s):6713 - 6736
| | PDF (3426 KB) | HTML

In this paper, we propose a new characterization for leafless elementary trapping sets (LETSs) of variable-regular lowdensity parity-check codes. Recently, Karimi and Banihashemi proposed a characterization of LETSs, which was based on viewing an LETS as a layered superset (LSS) of a short cycle in the code's Tanner graph. A notable advantage of LSS characterization is that it corresponds to a sim... View full abstract»

• ### Partial Inverses mod $m(x)$ and Reverse Berlekamp–Massey Decoding

Publication Year: 2016, Page(s):6737 - 6756
| | PDF (328 KB) | HTML

This semi-tutorial paper introduces the partial-inverse problem for polynomials and develops its application to decoding Reed-Solomon codes and some related codes. The most natural algorithm to solve the partial-inverse problem is very similar to, but more general than, the Berlekamp-Massey algorithm. Two additional algorithms are obtained as easy variations of the basic algorithm: the first varia... View full abstract»

• ### BCH Codes for the Rosenbloom–Tsfasman Metric

Publication Year: 2016, Page(s):6757 - 6767
| | PDF (412 KB) | HTML

The Rosenbloom-Tsfasman metric has attracted the attention of many researchers as a generalization of the Hamming metric that is relevant to practical problems. Codes for this metric were considered. In particular, Reed-Solomon codes were generalized to be compatible with this metric. In this paper, a generalization of BCH codes for the Rosenbloom-Tsfasman metric is proposed. This generalization i... View full abstract»

• ### New Upper Bounds on Binary Linear Codes and a ${\mathbb Z}_{4}$ -Code With a Better-Than-Linear Gray Image

Publication Year: 2016, Page(s):6768 - 6771
| | PDF (337 KB) | HTML

Using integer linear programming and table-lookups, we prove that there is no binary linear [1988, 12, 992] code. As a by-product, the non-existence of binary linear codes with the parameters [324, 10, 160], [356, 10, 176], [772, 11, 384], and [836, 11, 416] is shown. Our work is motivated by the recent construction of the extended dualized Kerdock code K6*, which is a Z4-lin... View full abstract»

• ### Multidimensional Quasi-Cyclic and Convolutional Codes

Publication Year: 2016, Page(s):6772 - 6785
| | PDF (497 KB) | HTML

We introduce multidimensional analogues of quasi-cyclic (QC) codes and study their algebraic structure. We demonstrate a concatenated structure for multidimensional QC codes and use this to prove that this class of codes is asymptotically good. We also relate the new family of codes to convolutional codes. It is known that the minimum distance of QC codes provides a natural lower bound on the free... View full abstract»

• ### On a Class of Left Metacyclic Codes

Publication Year: 2016, Page(s):6786 - 6799
| | PDF (663 KB) | HTML

Let G(m,3,r) = (x, y | xm = 1, y3 = 1, yx = xry) be a metacyclic group of order 3m, where gcd(m, r) = 1, 1 <; r <; m and r3 ≡ 1 (mod m). Then, left ideals of the group algebra Fq[G(m,3,r)] are called left metacyclic codes over Fq of length 3m, and abbreviated as left G(m,3,r)-codes. A system theory... View full abstract»

• ### On Rényi Entropy Power Inequalities

Publication Year: 2016, Page(s):6800 - 6815
| | PDF (522 KB) | HTML

This paper gives improved Rényi entropy power inequalities (R-EPIs). Consider a sum Sn = Σk=1n Xk of n independent continuous random vectors taking values on ℝd, and let α ∈ [1, ∞]. An R-EPI provides a lower bound on the order-α Rényi entropy power of Sn that, up to a multipl... View full abstract»

• ### Streaming Data Transmission in the Moderate Deviations and Central Limit Regimes

Publication Year: 2016, Page(s):6816 - 6830
Cited by:  Papers (1)
| | PDF (585 KB) | HTML

We consider streaming data transmission over a discrete memoryless channel. A new message is given to the encoder at the beginning of each block and the decoder decodes each message sequentially, after a delay of T blocks. In this streaming setup, we study the fundamental interplay between the rate and error probability in the central limit and moderate deviations regimes and show that: 1) in the ... View full abstract»

• ### Minimum Energy to Send $k$ Bits Over Multiple-Antenna Fading Channels

Publication Year: 2016, Page(s):6831 - 6853
| | PDF (706 KB) | HTML

This paper investigates the minimum energy required to transmit k information bits with a given reliability over a multiple-antenna Rayleigh block-fading channel, with and without channel state information (CSI) at the receiver. No feedback is assumed. It is well known that the ratio between the minimum energy per bit and the noise level converges to -1.59 dB as k goes to infinity, regardless of w... View full abstract»

• ### Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations

Publication Year: 2016, Page(s):6854 - 6883
| | PDF (2803 KB) | HTML

In this paper, we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime. The chosen converse and random coding union bounds were taken from the recent work of Polyanskyi-Poor-Verdù, and are investigated under parallel AWGN channels, the AWGN channel, the BI-AWGN channel, and the BSC. T... View full abstract»

• ### On the Capacity of Vector Gaussian Channels With Bounded Inputs

Publication Year: 2016, Page(s):6884 - 6903
| | PDF (1466 KB) | HTML

The capacity of a deterministic multiple-input multiple-output channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher dimension settings to derive the necessary and sufficient conditions for the optimal input probability density function. This approach prevents the usage of the identity theor... View full abstract»

• ### Waterfilling Theorems for Linear Time-Varying Channels and Related Nonstationary Sources

Publication Year: 2016, Page(s):6904 - 6916
| | PDF (816 KB) | HTML

The capacity of the linear time-varying (LTV) channel, a continuous-time LTV filter with additive white Gaussian noise, is characterized by waterfilling in the time-frequency plane. Similarly, the rate distortion function for a related nonstationary source is characterized by reverse waterfilling in the time-frequency plane. Constraints on the average energy or on the squared-error distortion, res... View full abstract»

• ### Capacity Theorems for Broadcast Channels With Two Channel State Components Known at the Receivers

Publication Year: 2016, Page(s):6917 - 6930
| | PDF (650 KB) | HTML

We establish the capacity region of several classes of broadcast channels with random state in which the channel to each user is selected from two possible channel state components and the state is known only at the receivers. When the channel components are deterministic, we show that the capacity region is achieved via Marton coding. This channel model does not belong to any class of broadcast c... View full abstract»

• ### An Ergodic Theory of Binary Operations—Part I: Key Properties

Publication Year: 2016, Page(s):6931 - 6952
Cited by:  Papers (1)
| | PDF (548 KB) | HTML

An open problem in polarization theory is to determine the binary operations that always lead to polarization (in the general multilevel sense) when they are used in Arıkan style constructions. This paper, which is presented in two parts, solves this problem by providing a necessary and sufficient condition for a binary operation to be polarizing. This (first) part of this paper introduces ... View full abstract»

• ### The Capacity Region of the $L$ -User Gaussian Inverse Compute-and-Forward Problem

Publication Year: 2016, Page(s):6953 - 6968
| | PDF (1443 KB) | HTML

We consider an L-user multiple access channel where transmitter m has access to the linear equation um = ⊕l=1L fmlwl of independent messages wl ∈ Fpkl with fml ∈ Fp, and the destination wishes to recover all L messages. This problem may be motivated as the last hop in ... View full abstract»

• ### On the Symmetric $K$ -User Interference Channels With Limited Feedback

Publication Year: 2016, Page(s):6969 - 6985
| | PDF (1160 KB) | HTML

In this paper, we develop achievability schemes for symmetric K-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the linear deterministic model, and the Gaussian model. For the deterministic model, the proposed scheme achieves a symmetric rate that is the minimum of the symmetric c... View full abstract»

• ### Cooperation for Interference Management: A GDoF Perspective

Publication Year: 2016, Page(s):6986 - 7029
Cited by:  Papers (1)
| | PDF (3556 KB) | HTML

The impact of cooperation on interference management is investigated by studying an elemental wireless network, the so-called symmetric interference relay channel (IRC), from a generalized degrees of freedom (GDoF) perspective. This is motivated by the fact that the deployment of relays is considered as a remedy to overcome the bottleneck of current systems in terms of achievable rates. The focus ... View full abstract»

• ### Achievable DoF-Delay Trade-Offs for the $K$ -user MIMO Interference Channel With Delayed CSIT

Publication Year: 2016, Page(s):7030 - 7055
| | PDF (1557 KB) | HTML

The degrees of freedom (DoFs) of the K-user multiple-input multiple-output (MIMO) interference channel are studied when perfect, but delayed channel state information is available at the transmitter side (delayed CSIT). Recent works have proposed schemes improving the DoF knowledge of the interference channel, but at the cost of developing transmission involving many channel uses (long delay), thu... View full abstract»

• ### MISO Broadcast Channel With Hybrid CSIT: Beyond Two Users

Publication Year: 2016, Page(s):7056 - 7077
| | PDF (1115 KB) | HTML

We study the impact of heterogeneity of channel-state-information available at the transmitters (CSIT) on the capacity of broadcast channels with a multiple-antenna transmitter and k single-antenna receivers (MISO BC). In particular, we consider the k-user MISO BC, where the CSIT with respect to each receiver can be either instantaneous/perfect, delayed, or not available; and we study the impact o... 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