# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 44
• ### Table of contents

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

Publication Year: 2014, Page(s): C2
| |PDF (142 KB)
• ### Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics

Publication Year: 2014, Page(s):777 - 795
Cited by:  Papers (24)
| |PDF (662 KB) | HTML

This paper provides an extensive study of the behavior of the best achievable rate (and other related fundamental limits) in variable-length strictly lossless compression. In the non-asymptotic regime, the fundamental limits of fixed-to-variable lossless compression with and without prefix constraints are shown to be tightly coupled. Several precise, quantitative bounds are derived, connecting the... View full abstract»

• ### Compression With Actions

Publication Year: 2014, Page(s):796 - 807
Cited by:  Papers (6)
| |PDF (669 KB) | HTML

We consider the setting where actions can be used to modify a state sequence before compression. The minimum rate needed to losslessly describe the optimal modified sequence is characterized when the state sequence is either noncausally or causally available at the action encoder. The achievability is closely related to the optimal channel coding strategy for channel with states. We also extend th... View full abstract»

• ### About Adaptive Coding on Countable Alphabets

Publication Year: 2014, Page(s):808 - 821
Cited by:  Papers (3)
| |PDF (300 KB) | HTML

This paper sheds light on adaptive coding with respect to classes of memoryless sources over a countable alphabet defined by an envelope function with finite and non-decreasing hazard rate (log-concave envelope distributions). We prove that the auto-censuring (AC) code is adaptive with respect to the collection of such classes. The analysis builds on the tight characterization of universal redunda... View full abstract»

• ### Identification and Lossy Reconstruction in Noisy Databases

Publication Year: 2014, Page(s):822 - 831
Cited by:  Papers (7)
| |PDF (738 KB) | HTML

A high-dimensional database system is studied where the noisy versions of the underlying feature vectors are observed in both the enrollment and query phases. The noisy observations are compressed before being stored in the database, and the user wishes to both identify the correct entry corresponding to the noisy query vector and reconstruct the original feature vector within a desired distortion... View full abstract»

• ### Exponential Error Bounds on Parameter Modulation–Estimation for Discrete Memoryless Channels

Publication Year: 2014, Page(s):832 - 841
Cited by:  Papers (3)
| |PDF (242 KB) | HTML

We consider the problem of modulation and estimation of a random parameter U to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the estimation error, E|Û-U|ρ, ρ ≥ 0, when both the modulator and the estimator are subjected to optimization. These exponent... View full abstract»

• ### A Broadcast Approach for Fading Wiretap Channels

Publication Year: 2014, Page(s):842 - 858
Cited by:  Papers (17)
| |PDF (956 KB) | HTML

A (layered) broadcast approach is studied for the fading wiretap channel without the channel state information (CSI) at the transmitter. Two broadcast schemes, based on superposition coding and embedded coding, respectively, are developed to encode information into a number of layers and use stochastic encoding to keep the corresponding information secret from an eavesdropper. The layers that can ... View full abstract»

• ### Interference Channel With a Causal Relay Under Strong and Very Strong Interference

Publication Year: 2014, Page(s):859 - 865
Cited by:  Papers (9)
| |PDF (267 KB) | HTML

In this paper, we study a two-user interference channel with a causal relay, where the relay's transmit symbol depends not only on its past received symbols, but also on its present received symbol. This is an appropriate model for studying amplify-and-forward type relaying when the bandwidth delay-spread product is much smaller than one. For the discrete memoryless interference channel with a cau... View full abstract»

• ### Approximate Ergodic Capacity of a Class of Fading Two-User Two-Hop Networks

Publication Year: 2014, Page(s):866 - 880
Cited by:  Papers (6)
| |PDF (877 KB) | HTML

The fading AWGN two-user two-hop network is considered where the channel coefficients are independent and identically distributed (i.i.d.) according to a continuous distribution and vary over time. For a broad class of channel distributions, the ergodic sum capacity is characterized to within a constant number of bits/second/hertz, independent of the signal-to-noise ratio. The achievability follow... View full abstract»

• ### On the Dispersions of Three Network Information Theory Problems

Publication Year: 2014, Page(s):881 - 903
Cited by:  Papers (25)
| |PDF (696 KB) | HTML

We analyze the dispersions of distributed lossless source coding (the Slepian-Wolf problem), the multiple-access channel, and the asymmetric broadcast channel. For the two-encoder Slepian-Wolf problem, we introduce a quantity known as the entropy dispersion matrix, which is analogous to the scalar dispersions that have gained interest recently. We prove a global dispersion result that can be expre... View full abstract»

• ### Optimality and Approximate Optimality of Source-Channel Separation in Networks

Publication Year: 2014, Page(s):904 - 918
Cited by:  Papers (20)
| |PDF (616 KB) | HTML

We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal in two general scenarios and is approximately optimal in a third scenario. The two scenarios for which separation is optimal complement each other: the first is when the memoryless sources at source nodes are arbitrarily correlated, each of w... View full abstract»

• ### Fast Sparse Superposition Codes Have Near Exponential Error Probability for $R<{cal C}$

Publication Year: 2014, Page(s):919 - 942
Cited by:  Papers (17)
| |PDF (694 KB) | HTML

For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. These codes are based on the statistical high-dimensional regression framework. In a previous paper, we investigated decoding using the optimal maximum-likelihood decoding scheme. Here, a fast decoding algorithm, called the adaptive successive decoder, is developed. For a... View full abstract»

• ### Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees

Publication Year: 2014, Page(s):943 - 963
Cited by:  Papers (1)
| |PDF (602 KB) | HTML

Applying the max-product (and sum-product) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no general understanding of the conditions required for convergence or optimality of converged solutions or both. This paper presents an analysis of both attenuated ... View full abstract»

• ### Rewriting Codes for Flash Memories

Publication Year: 2014, Page(s):964 - 975
| |PDF (408 KB) | HTML

Flash memory is a nonvolatile computer memory comprising blocks of cells, wherein each cell can take on q different values or levels. While increasing the cell level is easy, reducing the level of a cell can be accomplished only by erasing an entire block. Since block erasures are highly undesirable, coding schemes-known as floating codes (or flash codes) and buffer codes-have been designed in ord... View full abstract»

• ### Codes for Information Retrieval With Small Uncertainty

Publication Year: 2014, Page(s):976 - 985
Cited by:  Papers (5)
| |PDF (388 KB) | HTML

In a recent paper by Yaakobi and Bruck, the problem of information retrieval in associative memories has been considered. In an associative memory, each memory entry is associated to the neighboring entries. When searching information, a fixed number of input clues are given and the output set is formed by the entries associated to all the input clues. The maximum size of an output set is called t... View full abstract»

• ### Chains, Demi-Matroids, and Profiles

Publication Year: 2014, Page(s):986 - 991
| |PDF (180 KB) | HTML

It is shown that each chain of linear codes has an associated demi-matroid, a combinatorial structure that extends the notion of a vector matroid of a linear code. These demi-matroids are proven to determine important properties of the chain, and it is shown that linear code chain duality is represented by demi-matroid duality in a natural and yet surprising way. Profiles are defined for arbitrary... View full abstract»

• ### Fast-Decodable MIDO Codes With Large Coding Gain

Publication Year: 2014, Page(s):992 - 1007
Cited by:  Papers (6)
| |PDF (1118 KB) | HTML

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of two complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input double output (MIDO) systems. Using this method, rate-2 STBCs for 4 × 2, 6 × 2, 8 × 2, and 12 × 2 systems are constructed and these STBCs are fast ML-decodable, have large coding gains... View full abstract»

• ### Functional Forwarding of Channel State Information

Publication Year: 2014, Page(s):1008 - 1018
| |PDF (581 KB) | HTML

Based on the recent compute-and-forward technique , a novel communication strategy is proposed under which functions of the channel state information are forwarded along the network. Those functions are chosen such that on the one hand, they can be efficiently forwarded, and on the other hand, they are maximally useful to the final decoder of the message. It is illustrated that there is generally ... View full abstract»

• ### Diversity of MIMO Linear Precoding

Publication Year: 2014, Page(s):1019 - 1038
Cited by:  Papers (11)
| |PDF (799 KB) | HTML

This paper studies multiple-input multiple-output linear precoding in the high-signal-to-noise-ratio regime under flat fading. The diversity at all fixed rates is analyzed for a number of linear precoders. The diversity-multiplexing tradeoffs (DMTs) are also obtained, discovering that for many linear precoders the DMT gives no direct insight into the intricate behavior of fixed-rate diversity. The... View full abstract»

• ### Fundamental Limits of Infinite Constellations in MIMO Fading Channels

Publication Year: 2014, Page(s):1039 - 1060
Cited by:  Papers (5)
| |PDF (550 KB) | HTML

The fundamental and natural connection between the infinite constellation (IC) dimension and the best diversity order it can achieve is investigated in this paper. In the first part of this paper, we develop an upper bound on the diversity order of ICs for any dimension and any number of transmit and receive antennas. By choosing the right dimensions, we prove in the second part of this paper that... View full abstract»

• ### High-SNR Asymptotics of Mutual Information for Discrete Constellations With Applications to BICM

Publication Year: 2014, Page(s):1061 - 1076
Cited by:  Papers (17)
| |PDF (2281 KB) | HTML

Asymptotic expressions of the mutual information between any discrete input and the corresponding output of the scalar additive white Gaussian noise channel are presented in the limit as the signal-to-noise ratio (SNR) tends to infinity. Asymptotic expressions of the symbol-error probability (SEP) and the minimum mean-square error (MMSE) achieved by estimating the channel input given the channel o... View full abstract»

• ### Connections Between the Generalized Marcum $Q$ -Function and a Class of Hypergeometric Functions

Publication Year: 2014, Page(s):1077 - 1082
Cited by:  Papers (11)
| |PDF (229 KB) | HTML

This paper presents a new connection between the generalized Marcum-Q function and the confluent hypergeometric function of two variables, Φ3. This result is then applied to the closed-form characterization of the bivariate Nakagami-m distribution and of the distribution of the minimum eigenvalue of correlated noncentral Wishart matrices, both important in communication theory. N... View full abstract»

• ### Minimum-Time Link Scheduling for Emptying Wireless Systems: Solution Characterization and Algorithmic Framework

Publication Year: 2014, Page(s):1083 - 1100
Cited by:  Papers (15)
| |PDF (1230 KB) | HTML

We consider a set of transmitter-receiver pairs, or links, that share a wireless medium and address the problem of emptying backlogged queues with given initial size at the transmitters in minimum time. The problem amounts to determining activation subsets of links, and their time durations, to form a minimum-time schedule. Scheduling in wireless networks has been studied under various formulation... View full abstract»

• ### Scheduling in Multi-Channel Wireless Networks: Rate Function Optimality in the Small-Buffer Regime

Publication Year: 2014, Page(s):1101 - 1125
Cited by:  Papers (6)
| |PDF (873 KB) | HTML

The problem of designing scheduling algorithms for a multichannel (e.g., orthogonal frequency division multiplexing-based) wireless downlink network is considered. The classic MaxWeight algorithm, although throughput-optimal, results in a very poor per-user delay performance in such systems. Hence, an alternate class of algorithms called iterated longest queues first (iLQF) is proposed for overcom... 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