# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 49

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

Publication Year: 2014, Page(s): C2
| PDF (141 KB)
• ### Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake

Publication Year: 2014, Page(s):2417 - 2431
Cited by:  Papers (34)
| | PDF (714 KB) | HTML

We show that fully connected two-hop wireless networks with K sources, K relays, and K destinations have K degrees of freedom both in the case of time-varying channel coefficients and constant channel coefficients (in which case the result holds for almost all values of constant channel coefficients). Our main contribution is a new achievability scheme which we call Aligned Network Diagonalization... View full abstract»

• ### Subspace Alignment Chains and the Degrees of Freedom of the Three-User MIMO Interference Channel

Publication Year: 2014, Page(s):2432 - 2479
Cited by:  Papers (39)
| | PDF (8077 KB) | HTML

We show that the three-user MT × MR Multiple-Input Multiple-Output (MIMO) interference channel where each transmitter is equipped with MT antennas and each receiver is equipped with MR antennas has (M) d(M, N) =Δ min (M/2-1/κ, N/2+1/κ) degrees of freedom (DoF) normalized by time, frequency, and space dimensions, whe... View full abstract»

• ### Grassmannian Signalling Achieves Tight Bounds on the Ergodic High-SNR Capacity of the Noncoherent MIMO Full-Duplex Relay Channel

Publication Year: 2014, Page(s):2480 - 2494
Cited by:  Papers (5)
| | PDF (720 KB) | HTML

This paper considers the ergodic noncoherent capacity of a multiple-input multiple-output frequency-flat block Rayleigh fading full duplex relay channel at high signal-to-noise ratios (SNRs). It is shown that, for these SNRs, restricting the input distribution to be isotropic on a compact Grassmann manifold maximizes an upper bound on the cut-set bound. Furthermore, it is shown that, from a degree... View full abstract»

• ### Degrees of Freedom for the MIMO Multi-Way Relay Channel

Publication Year: 2014, Page(s):2495 - 2511
Cited by:  Papers (23)
| | PDF (2141 KB) | HTML

This paper investigates the degrees of freedom (DoF) of the L-cluster, K-user MIMO multiway relay channel, where users in each cluster wish to exchange messages within the cluster, and they can only communicate through the relay. A novel DoF upper bound is derived by providing users with carefully designed genie information. Achievable DoF is identified using signal space alignment and multiple-ac... View full abstract»

• ### On the Capacity of the Two-User Gaussian Causal Cognitive Interference Channel

Publication Year: 2014, Page(s):2512 - 2541
Cited by:  Papers (3)
| | PDF (2463 KB) | HTML

This paper considers the two-user Gaussian causal cognitive interference channel (GCCIC), which consists of two source-destination pairs that share the same channel and where one full-duplex cognitive source can causally learn the message of the primary source through a noisy link. The GCCIC is an interference channel with unilateral source cooperation that better models practical cognitive radio ... View full abstract»

• ### On the Gaussian Half-Duplex Relay Channel

Publication Year: 2014, Page(s):2542 - 2562
Cited by:  Papers (11)
| | PDF (1359 KB) | HTML

This paper considers the Gaussian half-duplex relay channel (G-HD-RC): a channel model where a source transmits a message to a destination with the help of a relay that cannot transmit and receive at the same time. It is shown that the cut-set upper bound on the capacity can be achieved to within a constant gap, regardless of the actual value of the channel parameters, by either partial-decode-and... View full abstract»

• ### Capacity of Gaussian Channels With Energy Harvesting and Processing Cost

Publication Year: 2014, Page(s):2563 - 2575
Cited by:  Papers (32)
| | PDF (1288 KB) | HTML

Energy harvesting sensor nodes are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting green communication. In this paper, we focus on communicating reliably over an additive white Gaussian noise channel using such an energy harvesting sensor node. An important part of this paper involves appropriate modeling of energy harvesting,... View full abstract»

• ### Decentralized Wireless Networks: Spread Spectrum Communications Revisited

Publication Year: 2014, Page(s):2576 - 2593
Cited by:  Papers (1)
| | PDF (927 KB) | HTML

This paper addresses a decentralized wireless networks of K separate transmitter-receiver pairs. Users treat each other as noise and there is no central controller to assign the resources to the users. Each user randomly spreads the symbols in its Gaussian codewords by the so-called signatures of spreading gain N. Any receiver is aware of the signatures of its affiliated transmitter, however, it i... View full abstract»

• ### Is Non-Unique Decoding Necessary?

Publication Year: 2014, Page(s):2594 - 2610
Cited by:  Papers (7)
| | PDF (422 KB) | HTML

In multiterminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi proposed a receiving strategy, which performs a joint unique decoding of messages of interest along with a subset of messages, which are not of interest. It is now well-known that this provides an achievable region, whic... View full abstract»

• ### A Bregman Matrix and the Gradient of Mutual Information for Vector Poisson and Gaussian Channels

Publication Year: 2014, Page(s):2611 - 2629
Cited by:  Papers (6)
| | PDF (563 KB) | HTML

A generalization of Bregman divergence is developed and utilized to unify vector Poisson and Gaussian channel models, from the perspective of the gradient of mutual information. The gradient is with respect to the measurement matrix in a compressive-sensing setting, and mutual information is considered for signal recovery and classification. Existing gradient-of-mutual-information results for scal... View full abstract»

• ### Information-Estimation Relationships Over Binomial and Negative Binomial Models

Publication Year: 2014, Page(s):2630 - 2646
Cited by:  Papers (4)
| | PDF (581 KB) | HTML

In recent years, a number of new connections between information measures and estimation have been found under various models, including, predominantly, Gaussian and Poisson models. This paper develops similar results for the binomial and negative binomial models. In particular, it is shown that the derivative of the relative entropy and the derivative of the mutual information for the binomial an... View full abstract»

• ### Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations

Publication Year: 2014, Page(s):2647 - 2666
Cited by:  Papers (24)
| | PDF (816 KB) | HTML

This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error exponents and second-order coding rates matching those of constant-composition random coding, while being directly applicable to channels with infinite or continuous a... View full abstract»

• ### Channel Coding and Lossy Source Coding Using a Generator of Constrained Random Numbers

Publication Year: 2014, Page(s):2667 - 2686
Cited by:  Papers (11)
| | PDF (530 KB) | HTML

Stochastic encoders for channel coding and lossy source coding are introduced with a rate close to the fundamental limits, where the only restriction is that the channel input alphabet and the reproduction alphabet of the lossy source code are finite. Random numbers, which satisfy a condition specified by a function and its value, are used to construct stochastic encoders. The proof of the theorem... View full abstract»

• ### The Concavity of Rényi Entropy Power

Publication Year: 2014, Page(s):2687 - 2693
Cited by:  Papers (16)
| | PDF (199 KB) | HTML

We associate to the pth Rényi entropy a definition of entropy power, which is the natural extension of Shannon's entropy power and exhibits a nice behavior along solutions to the p-nonlinear heat equation in Rn. We show that the Rényi entropy power of general probability densities solving such equations is always a concave function of time, whereas it has a linear behavior in corre... View full abstract»

• ### Mutual Information Matrices Are Not Always Positive Semidefinite

Publication Year: 2014, Page(s):2694 - 2696
Cited by:  Papers (2)
| | PDF (219 KB) | HTML

For discrete random variables X1, ..., Xn we construct an n by n matrix. In the (i, j)-entry we put the mutual information I(Xi ; Xj) between Xi and Xj. In particular, in the (i, i)-entry we put the entropy H(Xi) = I(Xi; Xi) of Xi. This matrix, called the mutual information matrix of (X View full abstract»

• ### Coding for Combined Block–Symbol Error Correction

Publication Year: 2014, Page(s):2697 - 2713
Cited by:  Papers (2)
| | PDF (1723 KB) | HTML

We design low-complexity error correction coding schemes for channels that introduce different types of errors and erasures: on the one hand, the proposed schemes can successfully deal with symbol errors and erasures, and, on the other hand, they can also successfully handle phased burst errors and erasures. View full abstract»

• ### Polarization Improves $E_{0}$

Publication Year: 2014, Page(s):2714 - 2719
Cited by:  Papers (3)
| | PDF (209 KB) | HTML

We prove that channel combining and splitting via Arikan's polarization transformation improves Gallager's reliability function E0 for binary input channels. In this sense, polarization creates E0. This observation gives yet another justification as to why the polar transform yields capacity achieving and low complexity codes: the improvement in E0 translates to an... View full abstract»

• ### Source and Channel Polarization Over Finite Fields and Reed–Solomon Matrices

Publication Year: 2014, Page(s):2720 - 2736
Cited by:  Papers (18)
| | PDF (654 KB) | HTML

Polarization phenomenon over any finite field Fq with size q being a power of a prime is considered. This problem is a generalization of the original proposal of channel polarization by Arıkan for the binary field, as well as its extension to a prime field by Sasoglu, Telatar, and Arıkan. In this paper, a necessary and sufficient condition of a matrix over a finite field Fq View full abstract»

• ### Least Squares Superposition Codes With Bernoulli Dictionary are Still Reliable at Rates up to Capacity

Publication Year: 2014, Page(s):2737 - 2750
Cited by:  Papers (2)
| | PDF (418 KB) | HTML

For the additive white Gaussian noise channel with average power constraint, sparse superposition codes with least squares decoding are proposed by Barron and Joseph in 2010. The codewords are designed by using a dictionary each entry of which is drawn from a Gaussian distribution. The error probability is shown to be exponentially small for all rates up to the capacity. This paper proves that whe... View full abstract»

• ### Lemma for Linear Feedback Shift Registers and DFTs Applied to Affine Variety Codes

Publication Year: 2014, Page(s):2751 - 2769
Cited by:  Papers (2)
| | PDF (2092 KB) | HTML

In this paper, we establish a lemma in algebraic coding theory that frequently appears in the encoding and decoding of, e.g., Reed-Solomon codes, algebraic geometry codes, and affine variety codes. Our lemma corresponds to the nonsystematic encoding of affine variety codes, and can be stated by giving a canonical linear map as the composition of an extension through linear feedback shift registers... View full abstract»

• ### An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes

Publication Year: 2014, Page(s):2770 - 2779
Cited by:  Papers (17)
| | PDF (493 KB) | HTML

Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. In particular, an (n, k) maximum distance separable (MDS) code stores k symbols in n disks such that the overall system is tolerant to a failure of up to n - k disks. However, access to at least k disks is still required to repair a single erasure. To reduce repair bandwidth, array codes are used w... View full abstract»

• ### Optimized Cell Programming for Flash Memories With Quantizers

Publication Year: 2014, Page(s):2780 - 2795
Cited by:  Papers (1)
| | PDF (1051 KB) | HTML

Multilevel flash memory contains blocks of cells that represent data by the amount of charge stored in them. The cell writing - or programming - process applies specified voltages in a sequential manner, injecting charge to achieve a desired level. Reducing a cell level requires a costly block erasure, so programming only increases cell levels. Parallel programming, whereby a common voltage is app... View full abstract»

• ### On the Asymptotic Performance of Bit-Wise Decoders for Coded Modulation

Publication Year: 2014, Page(s):2796 - 2804
Cited by:  Papers (2)
| | PDF (1178 KB) | HTML

Two decoder structures for coded modulation over the Gaussian channel are studied: 1) the maximum likelihood symbol-wise decoder and 2) the (suboptimal) bit-wise decoder based on the bit-interleaved coded modulation paradigm. We consider a 16-ary quadrature amplitude constellation labeled with a Gray labeling. It is shown that the asymptotic loss in terms of pairwise error probability, for any two... 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