# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 32

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

Publication Year: 2015, Page(s): C2
| PDF (138 KB)
• ### Error Exponent for Multiple Access Channels: Upper Bounds

Publication Year: 2015, Page(s):3605 - 3621
| | PDF (941 KB) | HTML

The problem of bounding the reliability function of a multiple access channel (MAC) is studied. Two new upper bounds on the error exponent of a two-user discrete memoryless (DM)-MAC are derived. The first bound (sphere packing) is an upper bound on the exponent of the average probability of error and is the first bound of this type that is zero outside the capacity region and thus results in a tig... View full abstract»

• ### A Note on the Broadcast Channel With Stale State Information at the Transmitter

Publication Year: 2015, Page(s):3622 - 3631
Cited by:  Papers (8)
| | PDF (670 KB) | HTML

This paper shows that the Maddah-Ali-Tse (MAT) scheme, which achieves the symmetric capacity of two example broadcast channels with strictly causal state information at the transmitter, is a simple special case of the Shayevitz-Wigger (SW) scheme for the broadcast channel with generalized feedback, which involves block Markov coding, Gray-Wyner compression, superposition coding, and Marton coding.... View full abstract»

• ### Capacity-Achieving Feedback Schemes for Gaussian Finite-State Markov Channels With Channel State Information

Publication Year: 2015, Page(s):3632 - 3650
Cited by:  Papers (2)
| | PDF (888 KB) | HTML

In this paper, we propose capacity-achieving communication schemes for Gaussian finite-state Markov channels subject to an average channel input power constraint, under the assumption that the transmitters can have access to delayed noiseless output feedback as well as instantaneous or delayed channel state information. We show that the proposed schemes reveals connections between feedback communi... View full abstract»

• ### A Randomized Algorithm for the Capacity of Finite-State Channels

Publication Year: 2015, Page(s):3651 - 3669
Cited by:  Papers (3)
| | PDF (589 KB) | HTML

Inspired by ideas from the field of stochastic approximation, we propose a randomized algorithm to compute the capacity of a finite-state channel with a Markovian input. When the mutual information rate of the channel is concave with respect to the chosen parameterization, the proposed algorithm proves to be convergent to the capacity of the channel almost surely with the derived convergence rate.... View full abstract»

• ### Random Access With Physical-Layer Network Coding

Publication Year: 2015, Page(s):3670 - 3681
Cited by:  Papers (15)
| | PDF (1002 KB) | HTML

We consider a physical-layer network coding strategy for the random-access channel, based on compute-and-forward. When packets collide, it is possible to reliably recover a linear combination of the packets at the receiver. Over many rounds of transmission, the receiver can thus obtain many linear combinations and eventually recover all original packets. This is by contrast to slotted ALOHA where ... View full abstract»

• ### On the Corner Points of the Capacity Region of a Two-User Gaussian Interference Channel

Publication Year: 2015, Page(s):3682 - 3697
Cited by:  Papers (5)
| | PDF (972 KB) | HTML

This paper considers the corner points of the capacity region of a two-user Gaussian interference channel (GIC). In a two-user GIC, the rate pairs where one user transmits its data at the single-user capacity (without interference), and the other at the largest rate for which reliable communication is still possible are called corner points. This paper relies on existing outer bounds on the capaci... View full abstract»

• ### Capacity Bounds for a Class of Interference Relay Channels

Publication Year: 2015, Page(s):3698 - 3721
Cited by:  Papers (3)
| | PDF (1238 KB) | HTML

The capacity of a class of interference relay channels (IRCs)-the injective semideterministic IRC where the relay can only observe one of the sources-is investigated. We first derive a novel outer bound and two inner bounds which are based on a careful use of each of the available cooperative strategies together with the adequate interference decoding technique. The outer bound extends Telatar and... View full abstract»

• ### On the Optimality of Treating Interference as Noise: General Message Sets

Publication Year: 2015, Page(s):3722 - 3736
Cited by:  Papers (16)
| | PDF (886 KB) | HTML

In a K-user Gaussian interference channel, it has been shown that if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user (all values in decibel scale), then treating interference as noise (TIN) is optimal from the perspective of generalized degrees of freedom (GDoF) and achieves ... View full abstract»

• ### Approximate Capacity Region for the Symmetric Gaussian Interference Channel With Noisy Feedback

Publication Year: 2015, Page(s):3737 - 3762
Cited by:  Papers (10)
| | PDF (1295 KB) | HTML

Recent results have shown that feedback can significantly increase the capacity of interference networks. This paper considers the impact of noise on such gains due to feedback. In particular, this paper considers the two-user linear deterministic interference channel with noisy feedback, as a stepping stone to characterize the approximate capacity region for the two-user Gaussian interference cha... View full abstract»

• ### On Feedback in Gaussian Multihop Networks

Publication Year: 2015, Page(s):3763 - 3772
| | PDF (653 KB) | HTML

The study of feedback has been mostly limited to single-hop communication settings. In this paper, we consider Gaussian networks where sources and destinations can communicate with the help of intermediate relays over multiple hops. We assume that links in the network can be bidirected providing opportunities for feedback. We ask the following question: can the information transfer in both directi... View full abstract»

• ### $H$-Transforms for Wireless Communication

Publication Year: 2015, Page(s):3773 - 3809
Cited by:  Papers (12)
| | PDF (8132 KB) | HTML

The H-transforms are integral transforms that involve Fox's H-functions as kernels. A large variety of integral transforms can be put into particular forms of the H-transform since H-functions subsume most of the known special functions including Meijer's G-functions. In this paper, we embody the H-transform theory into a unifying framework for modeling and analysis in wireless communication. Firs... View full abstract»

• ### $k$-Connectivity in Random Key Graphs With Unreliable Links

Publication Year: 2015, Page(s):3810 - 3836
Cited by:  Papers (32)
| | PDF (660 KB) | HTML

Random key graphs form a class of random intersection graphs that are naturally induced by the random key predistribution scheme of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have received much attention recently, owing in part to their wide applicability in various domains, including recommender systems, social networks, secure sensor networ... View full abstract»

• ### Cut-Set Bounds for Networks With Zero-Delay Nodes

Publication Year: 2015, Page(s):3837 - 3850
Cited by:  Papers (2)
| | PDF (398 KB) | HTML

In a network, a node is said to incur a delay if its encoding of each transmitted symbol involves only its received symbols obtained before the time slot in which the transmitted symbol is sent (hence the transmitted symbol sent in a time slot cannot depend on the received symbol obtained in the same time slot). A node is said to incur no delay if its received symbol obtained in a time slot is ava... View full abstract»

• ### Decentralized Wireless Networks With Asynchronous Users and Burst Transmissions

Publication Year: 2015, Page(s):3851 - 3881
| | PDF (1252 KB) | HTML

This paper studies a decentralized wireless network of asynchronous transmitter-receiver pairs with burst transmissions. Each receiver learns about the number of active users, channel coefficients, and mutual delays based on locally available measurements. The estimates for the mutual delays are not perfect, however, they are reliable enough to guarantee successful decoding. Two signalling schemes... View full abstract»

• ### A Capacity-Achieving Simple Decoder for Bias-Based Traitor Tracing Schemes

Publication Year: 2015, Page(s):3882 - 3900
Cited by:  Papers (5)
| | PDF (1517 KB) | HTML

We investigate alternative suspicion functions for bias-based traitor tracing schemes, and present a practical construction of a simple decoder that attains capacity in the limit of large coalition size c. We derive optimal suspicion functions in both the restricted-digit model and the combined-digit model. These functions depend on information that is usually not available to the tracer-the attac... View full abstract»

• ### Artificial Noise Revisited

Publication Year: 2015, Page(s):3901 - 3911
Cited by:  Papers (19)
| | PDF (631 KB) | HTML

The artificial noise (AN) scheme, proposed by Goel and Negi, is being considered as one of the key enabling technology for secure communications over multiple-output multiple-input wiretap channels. However, the decrease in secrecy rate due to the increase in the number of Eve's antennas is not well understood. In this paper, we develop an analytical framework to characterize the secrecy rate of t... View full abstract»

• ### Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding

Publication Year: 2015, Page(s):3912 - 3936
Cited by:  Papers (17)
| | PDF (589 KB) | HTML

By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C1of length n over a field extension Fqmand its subcode C2⊆ C1. One is called the relative dimension/intersection profile (RDIP), and the other is called the relative generalized rank weight (RGRW). We clarify their basic p... View full abstract»

• ### Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks

Publication Year: 2015, Page(s):3937 - 3953
Cited by:  Papers (11)
| | PDF (735 KB) | HTML

This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with minimum injection distance 2 or k - 1, where k is the constant dimension. Furthermore, we present a construction of new codes from old codes for any minimum di... View full abstract»

• ### Approaching the Rate-Distortion Limit With Spatial Coupling, Belief Propagation, and Decimation

Publication Year: 2015, Page(s):3954 - 3979
Cited by:  Papers (11)
| | PDF (1516 KB) | HTML

We investigate an encoding scheme for lossy compression of a binary symmetric source based on simple spatially coupled low-density generator-matrix codes. The degree of the check nodes is regular and the one of code-bits is Poisson distributed with an average depending on the compression rate. The performance of a low complexity belief propagation guided decimation algorithm is excellent. The algo... View full abstract»

• ### Network Compression: Worst Case Analysis

Publication Year: 2015, Page(s):3980 - 3995
Cited by:  Papers (1)
| | PDF (815 KB) | HTML

We study the problem of communicating a distributed correlated memoryless source over a memoryless network, from source nodes to destination nodes, under quadratic distortion constraints. We establish the following two complementary results: 1) for an arbitrary memoryless network, among all distributed memoryless sources of a given correlation, Gaussian sources are least compressible, that is, the... View full abstract»

• ### Robustness of Sparse Recovery via$F$-Minimization: A Topological Viewpoint

Publication Year: 2015, Page(s):3996 - 4014
Cited by:  Papers (2)
| | PDF (547 KB) | HTML

A recent trend in compressed sensing is to consider nonconvex optimization techniques for sparse recovery. The important case of F-minimization has become of particular interest, for which the exact reconstruction condition (ERC) in the noiseless setting can be precisely characterized by the null space property (NSP). However, little work has been done concerning its robust reconstruction conditio... View full abstract»

• ### Signal Reconstruction From the Magnitude of Subspace Components

Publication Year: 2015, Page(s):4015 - 4027
Cited by:  Papers (4)
| | PDF (498 KB) | HTML

We consider signal reconstruction from the norms of subspace components generalizing standard phase retrieval problems. In the deterministic setting, a closed reconstruction formula is derived when the subspaces satisfy certain cubature conditions, that require at least a quadratic number of subspaces. Moreover, we address reconstruction under the erasure of a subset of the norms; using the concep... View full abstract»

• ### $NP/CMP$Equivalence: A Phenomenon Hidden Among Sparsity Models$l_{0}$Minimization and$l_{p}$Minimization for Information Processing

Publication Year: 2015, Page(s):4028 - 4033
Cited by:  Papers (9)
| | PDF (930 KB) | HTML

In this paper, we have proved that in every underdetermined linear system Ax = b, there corresponds a constant p*(A, b) > 0 such that every solution to the l p-norm minimization problem also solves the l0-norm minimization problem whenever 0 <; p <; p*(A, b). This phenomenon is named NP/CMP equivalence. 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu