# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 45

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

Publication Year: 2013, Page(s): C2
| PDF (143 KB)
• ### Covering Numbers for Convex Functions

Publication Year: 2013, Page(s):1957 - 1965
Cited by:  Papers (5)
| | PDF (3217 KB) | HTML

In this paper, we study the covering numbers of the space of convex and uniformly bounded functions in multidimension. We find optimal upper and lower bounds for the ε-covering number of C([a, b]d, B), in the Lp-metric, 1 ≤ p <; ∞, in terms of the relevant constants, where d ≥ 1, a <; b ∈ ℝ, B > 0, and C([a, b]d, B... View full abstract»

• ### The Principle of Maximum Causal Entropy for Estimating Interacting Processes

Publication Year: 2013, Page(s):1966 - 1980
Cited by:  Papers (5)
| | PDF (3886 KB) | HTML

The principle of maximum entropy provides a powerful framework for estimating joint, conditional, and marginal probability distributions. However, there are many important distributions with elements of interaction and feedback where its applicability has not been established. This paper presents the principle of maximum causal entropy-an approach based on directed information theory for estimatin... View full abstract»

• ### Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm

Publication Year: 2013, Page(s):1981 - 2000
Cited by:  Papers (11)
| | PDF (5852 KB) | HTML

The belief propagation (BP) or sum-product algorithm is a widely used message-passing method for computing marginal distributions in graphical models. At the core of the BP message updates, when applied to a graphical model involving discrete variables with pairwise interactions, lies a matrix-vector product with complexity that is quadratic in the state dimension d, and requires transmissi... View full abstract»

• ### Robust Sparse Analysis Regularization

Publication Year: 2013, Page(s):2001 - 2016
Cited by:  Papers (38)
| | PDF (4167 KB) | HTML

This paper investigates the theoretical guarantees of l1-analysis regularization when solving linear inverse problems. Most of previous works in the literature have mainly focused on the sparse synthesis prior where the sparsity is measured as the l1 norm of the coefficients that synthesize the signal from a given dictionary. In contrast, the more general analys... View full abstract»

• ### Exact Recoverability From Dense Corrupted Observations via $ell _{1}$-Minimization

Publication Year: 2013, Page(s):2017 - 2035
Cited by:  Papers (10)
| | PDF (5423 KB) | HTML

This paper confirms a surprising phenomenon first observed by Wright under a different setting: given m highly corrupted measurements y = AΩ·x* + e*, where AΩ· is a submatrix whose rows are selected uniformly at random from rows of an orthogonal matrix A and e* is an unkn... View full abstract»

• ### Robust Lasso With Missing and Grossly Corrupted Observations

Publication Year: 2013, Page(s):2036 - 2058
Cited by:  Papers (12)
| | PDF (7136 KB) | HTML

This paper studies the problem of accurately recovering a k -sparse vector β* ∈ BBRp from highly corrupted linear measurements y=Xβ*+e*+w , where e* ∈ BBRn is a sparse error vector whose nonzero entries may be unbounded and w is a stochastic noise term. We propose ... View full abstract»

• ### Achievable Angles Between Two Compressed Sparse Vectors Under Norm/Distance Constraints Imposed by the Restricted Isometry Property: A Plane Geometry Approach

Publication Year: 2013, Page(s):2059 - 2081
Cited by:  Papers (8)
| | PDF (8259 KB) | HTML

The angle between two compressed sparse vectors subject to the norm/distance constraints imposed by the restricted isometry property (RIP) of the sensing matrix plays a crucial role in the studies of many compressive sensing (CS) problems. Assuming that u and v are two sparse vectors with∠ (u, v) = θ and the sensing matrix Φ satisfies RIP, this paper is aimed at analytically c... View full abstract»

• ### Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors

Publication Year: 2013, Page(s):2082 - 2102
Cited by:  Papers (105)  |  Patents (1)
| | PDF (6096 KB) | HTML

The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse signals. Practical ADCs not only sample but also quantize each measurement to a finite number of bits; moreover, there is an inverse relationship between the achievable sampling rate and the bit depth. In this paper, we in... View full abstract»

• ### Sampling High-Dimensional Bandlimited Fields on Low-Dimensional Manifolds

Publication Year: 2013, Page(s):2103 - 2127
Cited by:  Papers (12)
| | PDF (5564 KB) | HTML

Consider the task of sampling and reconstructing a bandlimited spatial field in R2 using moving sensors that take measurements along their path. It is inexpensive to increase the sampling rate along the paths of the sensors but more expensive to increase the total distance traveled by the sensors per unit area, which we call the path density. In this paper, we introduce the problem of d... View full abstract»

• ### Locally Most Powerful Invariant Tests for Correlation and Sphericity of Gaussian Vectors

Publication Year: 2013, Page(s):2128 - 2141
Cited by:  Papers (16)
| | PDF (2624 KB) | HTML

In this paper, we study the existence of locally most powerful invariant tests (LMPIT) for the problem of testing the covariance structure of a set of Gaussian random vectors. The LMPIT is the optimal test for the case of close hypotheses, among those satisfying the invariances of the problem, and in practical scenarios can provide better performance than the typically used generalized likelihood ... View full abstract»

• ### Another Proof for the Secrecy Capacity of the K-Receiver Broadcast Channel With Confidential Messages

Publication Year: 2013, Page(s):2142 - 2152
| | PDF (4028 KB) | HTML

The secrecy capacity region for the K-receiver degraded broadcast channel (BC) is given for confidential messages sent to the receivers and to be kept secret from an external wiretapper. Superposition coding and Wyner's random code partitioning are used to show the achievable rate tuples. Error probability analysis and equivocation calculation are also provided. In the converse proof, a new... View full abstract»

• ### Wiretap Channels: Implications of the More Capable Condition and Cyclic Shift Symmetry

Publication Year: 2013, Page(s):2153 - 2164
Cited by:  Papers (5)
| | PDF (3070 KB) | HTML

Characterization of the rate-equivocation region of a general wiretap channel involves two auxiliary random variables: U, for rate splitting and V, for channel prefixing. In this paper, we explore specific classes of wiretap channels for which the evaluation of the rate-equivocation region is simpler. We show that if the wiretap channel is more capable, V=X is optimal a... View full abstract»

• ### Multi-Receiver Wiretap Channel With Public and Confidential Messages

Publication Year: 2013, Page(s):2165 - 2177
Cited by:  Papers (8)
| | PDF (4602 KB) | HTML

We study the multi-receiver wiretap channel (MR-WC) with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter sends a pair of public and confidential messages to each legitimate user. While there are no secrecy constraints on the public messages, confidential messa... View full abstract»

• ### Secure Source Coding With a Helper

Publication Year: 2013, Page(s):2178 - 2187
Cited by:  Papers (18)
| | PDF (2494 KB) | HTML

We consider a secure lossless source coding problem with a rate-limited helper. In particular, Alice observes an independent and identically distributed (i.i.d.) source Xn and wishes to transmit this source losslessly to Bob over a rate-limited link of capacity not exceeding Rx . A helper, say Helen, observes an i.i.d. correlated source Yn and can transmit information to Bob o... View full abstract»

• ### The AWGN Red Alert Problem

Publication Year: 2013, Page(s):2188 - 2200
Cited by:  Papers (5)
| | PDF (2775 KB) | HTML

Consider the following unequal error protection scenario. One special message, dubbed the “red alert” message, is required to have an extremely small probability of missed detection. The remainder of the messages must keep their average probability of error and probability of false alarm below a certain threshold. The goal then is to design a codebook that maximizes the error exponen... View full abstract»

• ### Extremes of Error Exponents

Publication Year: 2013, Page(s):2201 - 2207
Cited by:  Papers (6)
| | PDF (1701 KB) | HTML

This paper determines the range of feasible values of standard error exponents for binary-input memoryless symmetric channels of fixed capacity C and shows that extremes are attained by the binary symmetric and the binary erasure channel. The proof technique also provides analogous extremes for other quantities related to Gallager's E0 function, such as the cutoff rate, th... View full abstract»

• ### On the Achievable Rate of Stationary Rayleigh Flat-Fading Channels With Gaussian Inputs

Publication Year: 2013, Page(s):2208 - 2220
Cited by:  Papers (4)
| | PDF (3201 KB) | HTML

In this work, a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver side is studied. The law of the channel is presumed to be known to the receiver. For independent identically distributed (i.i.d.) zero-mean proper Gaussian input distributions, the achievable rate is investigated. The main contribution of this paper is the deriva... View full abstract»

• ### On Noncoherent Fading Relay Channels at High Signal-to-Noise Ratio

Publication Year: 2013, Page(s):2221 - 2241
Cited by:  Papers (2)
| | PDF (6034 KB) | HTML

The capacity of noncoherent regular-fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the receiver can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at hig... View full abstract»

• ### The State-Dependent Semideterministic Broadcast Channel

Publication Year: 2013, Page(s):2242 - 2251
Cited by:  Papers (12)
| | PDF (2585 KB) | HTML

We derive the capacity region of the state-dependent semideterministic broadcast channel with noncausal state information at the transmitter. One of the two outputs of this channel is a deterministic function of the channel input and the channel state, and the state is assumed to be known noncausally to the transmitter but not to the receivers. We show that appending the state to the deterministic... View full abstract»

• ### Multiple-Access Channel With Partial and Controlled Cribbing Encoders

Publication Year: 2013, Page(s):2252 - 2266
Cited by:  Papers (10)
| | PDF (4512 KB) | HTML

In this paper, we consider a multiple-access channel (MAC) with partial cribbing encoders. This means that each of the two encoders obtains a deterministic function of the output of the other encoder with or without delay. The partial cribbing scheme is especially motivated by the additive noise Gaussian MAC, where perfect cribbing results in the degenerated case of full cooperation between the en... View full abstract»

• ### Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization

Publication Year: 2013, Page(s):2267 - 2276
Cited by:  Papers (23)  |  Patents (2)
| | PDF (3016 KB) | HTML

We consider the asymptotic behavior of the polarization process in the large block-length regime when transmission takes place over a binary-input memoryless symmetric channel W. In particular, we study the asymptotics of the cumulative distribution P(Zn ≤ z), where {Zn} is the Bhattacharyya process associated with W, and its dependence on the rate of tran... View full abstract»

• ### Windowed Decoding of Spatially Coupled Codes

Publication Year: 2013, Page(s):2277 - 2292
Cited by:  Papers (12)
| | PDF (4222 KB) | HTML

Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach the Shannon limit, as well as for finite lengths, since degree-2 variable nodes that result in high error floors can be completely avoided. However, to realize the promised goo... View full abstract»

• ### The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes

Publication Year: 2013, Page(s):2293 - 2314
Cited by:  Papers (12)
| | PDF (4640 KB) | HTML

For low-density parity-check (LDPC) codes operating over additive white Gaussian noise channels and decoded using message-passing decoders with limited precision, absorbing sets have been shown to be a key factor in error floor behavior. Focusing on this scenario, this paper introduces the cycle consistency matrix (CCM) as a powerful analytical tool for characterizing and avoiding absorbing sets i... 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