# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 35

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

Publication Year: 2014, Page(s): C2
| PDF (141 KB)
• ### Soft-Decoding-Based Strategies for Relay and Interference Channels: Analysis and Achievable Rates Using LDPC Codes

Publication Year: 2014, Page(s):1977 - 2009
Cited by:  Papers (10)
| | PDF (1100 KB) | HTML

We provide a rigorous mathematical analysis of two communication strategies: soft decode-and-forward (soft-DF) for relay channels and soft partial interference-cancelation (soft-IC) for interference channels. Both strategies involve soft estimation, which assists the decoding process. We consider LDPC codes, not because of their practical benefits, but because of their analytic tractability, which... View full abstract»

• ### Bounds and Constructions for Granular Media Coding

Publication Year: 2014, Page(s):2010 - 2027
Cited by:  Papers (6)
| | PDF (1157 KB) | HTML

Bounds on the rates of grain-correcting codes are presented. The lower bounds are Gilbert-Varshamov-like ones, whereas the upper bounds improve on the previously known result by Mazumdar Constructions of t-grain-correcting codes of length n for certain values of n and t are discussed. Finally, an infinite family of codes of rate approaching 1 that can detect an arbitrary number of grain errors is ... View full abstract»

• ### Access Versus Bandwidth in Codes for Storage

Publication Year: 2014, Page(s):2028 - 2037
Cited by:  Papers (14)
| | PDF (369 KB) | HTML

Maximum distance separable (MDS) codes are widely used in storage systems to protect against disk (node) failures. A node is said to have capacity l over some field F, if it can store that amount of symbols of the field. An (n, k, l) MDS code uses n nodes of capacity l to store k information nodes. The MDS property guarantees the resiliency to any n-k node failures. An optimal... View full abstract»

• ### Unique Decoding of General AG Codes

Publication Year: 2014, Page(s):2038 - 2053
Cited by:  Papers (4)
| | PDF (1490 KB) | HTML

A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it retains the same advantages of fast speed, regular structure, and direct message recovery. Upon this generalization, we add a technique from the Guruswami-Sudan li... View full abstract»

• ### Fast Decoding of Multipoint Codes from Algebraic Curves

Publication Year: 2014, Page(s):2054 - 2064
| | PDF (1048 KB) | HTML

Multipoint codes are a broad class of algebraic geometry codes derived from algebraic functions, which have multiple poles and/or zeros on an algebraic curve. Thus, they are more general than one-point codes, which are an important class of algebraic geometry codes in the sense that they can be decoded efficiently using the Berlekamp-Massey-Sakata algorithm. We present a fast method for decoding m... View full abstract»

• ### Propelinear 1-Perfect Codes From Quadratic Functions

Publication Year: 2014, Page(s):2065 - 2068
Cited by:  Papers (3)
| | PDF (155 KB) | HTML

Perfect codes obtained by the Vasil'ev-Schönheim construction from a linear base code and quadratic switching functions are transitive and, moreover, propelinear. This gives at least exp(cN2) propelinear 1-perfect codes of length N over an arbitrary finite field, while an upper bound on the number of transitive codes is exp(C(NlnN)2vphantom)). View full abstract»

• ### Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose

Publication Year: 2014, Page(s):2069 - 2079
Cited by:  Papers (12)
| | PDF (269 KB) | HTML

We study the distinguishability of bipartite quantum states by positive operator-valued measures with positive partial transpose (PPT POVMs). The contributions of this paper include: 1) we give a negative answer to an open problem of showing a limitation of a previous known method for detecting nondistinguishability; 2) we show that a maximally entangled state and its orthogonal complement, no mat... View full abstract»

• ### Constacyclic Codes and Some New Quantum MDS Codes

Publication Year: 2014, Page(s):2080 - 2086
Cited by:  Papers (34)
| | PDF (510 KB) | HTML

One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. Quantum maximal distance separable (MDS) codes are optimal in the sense they attain maximal minimum distance. Recently, constructing quantum MDS codes has received much attention and seems to become more and more difficult. In this paper, based on classical constacyclic codes, we constru... View full abstract»

• ### The Capacity Region of the Two-Receiver Gaussian Vector Broadcast Channel With Private and Common Messages

Publication Year: 2014, Page(s):2087 - 2104
Cited by:  Papers (20)
| | PDF (387 KB) | HTML

A novel method for establishing the optimality of Gaussian auxiliary random variables in multiterminal information theory problems is developed. This method is then employed to show that Marton's inner bound achieves the capacity region of the two-receiver Gaussian vector broadcast channel with private and common messages. View full abstract»

• ### Information Networks With In-Block Memory

Publication Year: 2014, Page(s):2105 - 2120
Cited by:  Papers (7)
| | PDF (706 KB) | HTML

A class of channels is introduced for which there is memory inside blocks of a specified length and no memory across the blocks. The multiuser model is called an information network with in-block memory (NiBM). It is shown that block-fading channels, channels with state known causally at the encoder, and relay networks with delays are NiBMs. A cut-set bound is developed for NiBMs that unifies, str... View full abstract»

• ### Providing Secrecy With Structured Codes: Two-User Gaussian Channels

Publication Year: 2014, Page(s):2121 - 2138
Cited by:  Papers (29)
| | PDF (791 KB) | HTML

Recent results have shown that structured codes can be used to construct good channel codes, source codes, and physical layer network codes for Gaussian channels. For Gaussian channels with secrecy constraints, however, efforts to date rely on Gaussian random codes. In this paper, we advocate that structure in random code generation is useful for providing secrecy as well. In particular, a Gaussia... View full abstract»

• ### Canalizing Boolean Functions Maximize Mutual Information

Publication Year: 2014, Page(s):2139 - 2147
Cited by:  Papers (5)
| | PDF (527 KB) | HTML

Information processing in biologically motivated Boolean networks is of interest in recent information theoretic research. One measure to quantify this ability is the well-known mutual information. Using Fourier analysis, we show that canalizing functions maximize mutual information between a single input variable and the outcome of a function with fixed expectation. A similar result can be obtain... View full abstract»

• ### On the Capacity of the Interference Channel With a Cognitive Relay

Publication Year: 2014, Page(s):2148 - 2179
Cited by:  Papers (14)
| | PDF (3594 KB) | HTML

The interference channel with a cognitive relay (IFC-CR) consists of the classical IFC with two independent source-destination pairs whose communication are aided by an additional node, referred to as the CR, that has a priori knowledge of both sources' messages. This a priori message knowledge is termed cognition and idealizes the relay learning the messages of the two sources from their transmis... View full abstract»

• ### Linear Degrees of Freedom of the $X$ -Channel With Delayed CSIT

Publication Year: 2014, Page(s):2180 - 2189
Cited by:  Papers (34)
| | PDF (426 KB) | HTML

We establish the degrees of freedom (DoF) of the two-user X-channel with delayed channel knowledge at transmitters [i.e., delayed channel state information at the transmitters (CSIT)], assuming linear coding strategies at the transmitters. We derive a new upper bound and characterize the linear DoF of this network to be 6/5. The converse builds upon our development of a general lemma that shows th... View full abstract»

• ### Analysis of Mismatched Estimation Errors Using Gradients of Partition Functions

Publication Year: 2014, Page(s):2190 - 2216
Cited by:  Papers (6)
| | PDF (1460 KB) | HTML

We consider the problem of signal estimation (denoising) from a statistical-mechanical perspective, in continuation to a recent work on the analysis of mean-square error (MSE) estimation using a direct relationship between optimum estimation and certain partition functions. This paper consists of essentially two parts. In the first part, using the aforementioned relationship, we derive single-lett... View full abstract»

• ### Optimal Detection of Sparse Mixtures Against a Given Null Distribution

Publication Year: 2014, Page(s):2217 - 2232
Cited by:  Papers (8)
| | PDF (401 KB) | HTML

Detection of sparse signals arises in a wide range of modern scientific studies. The focus so far has been mainly on Gaussian mixture models. In this paper, we consider the detection problem under a general sparse mixture model and obtain explicit expressions for the detection boundary under mild regularity conditions. In addition, for Gaussian null hypothesis, we establish the adaptive optimality... View full abstract»

• ### Collaborative 20 Questions for Target Localization

Publication Year: 2014, Page(s):2233 - 2252
Cited by:  Papers (13)
| | PDF (1023 KB) | HTML

We consider the problem of 20 questions with noise for multiple players under the minimum entropy criterion in the setting of stochastic search, with application to target localization. Each player yields a noisy response to a binary query governed by a certain error probability. First, we propose a sequential policy for constructing questions that queries each player in sequence and refines the p... View full abstract»

• ### Minimum Complexity Pursuit for Universal Compressed Sensing

Publication Year: 2014, Page(s):2253 - 2268
Cited by:  Papers (12)
| | PDF (476 KB) | HTML

The nascent field of compressed sensing is founded on the fact that high-dimensional signals with simple structure can be recovered accurately from just a small number of randomized samples. Several specific kinds of structures have been explored in the literature, from sparsity and group sparsity to low-rankness. However, two fundamental questions have been left unanswered. What are the general a... View full abstract»

• ### Greedy Adaptive Linear Compression in Signal-Plus-Noise Models

Publication Year: 2014, Page(s):2269 - 2280
Cited by:  Papers (4)
| | PDF (621 KB) | HTML

In this paper, we examine adaptive compression policies, when the sequence of vector-valued measurements to be compressed is noisy and the compressed variables are themselves noisy. The optimization criterion is information gain. In the case of sequential scalar compressions, the unit-norm compression vectors that greedily maximize per-stage information gain are eigenvectors of an a priori error c... View full abstract»

• ### The Sparse Principal Component of a Constant-Rank Matrix

Publication Year: 2014, Page(s):2281 - 2290
Cited by:  Papers (1)
| | PDF (3389 KB) | HTML

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem NP-hard. In this paper, we prove that, if the matrix is positive semidefinite and its rank is constant, then its sparse principal component is polynomially computable. Our proof u... View full abstract»

• ### Deterministic Sensing Matrices Arising From Near Orthogonal Systems

Publication Year: 2014, Page(s):2291 - 2302
Cited by:  Papers (27)
| | PDF (1043 KB) | HTML

Compressed sensing is a novel sampling theory, which provides a fundamentally new approach to data acquisition. It asserts that a sparse or compressible signal can be reconstructed from much fewer measurements than traditional methods. A central problem in compressed sensing is the construction of the sensing matrix. While random sensing matrices have been studied intensively, only a few determini... View full abstract»

• ### Oracle Inequalities for a Group Lasso Procedure Applied to Generalized Linear Models in High Dimension

Publication Year: 2014, Page(s):2303 - 2318
Cited by:  Papers (1)
| | PDF (630 KB) | HTML

We present a group lasso procedure for generalized linear models (GLMs) and we study the properties of this estimator applied to sparse high-dimensional GLMs. Under general conditions on the covariates and on the joint distribution of the pair covariates, we provide oracle inequalities promoting group sparsity of the covariables. We get convergence rates for the prediction and estimation error and... View full abstract»

• ### Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing

Publication Year: 2014, Page(s):2319 - 2330
Cited by:  Papers (19)
| | PDF (1502 KB) | HTML

Despite the important properties of unit norm tight frames (UNTFs) and equiangular tight frames (ETFs), their construction has been proven extremely difficult. The few known techniques produce only a small number of such frames while imposing certain restrictions on frame dimensions. Motivated by the application of incoherent tight frames in compressed sensing (CS), we propose a methodology to con... 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