IEEE Transactions on Information Theory

Filter Results

Displaying Results 1 - 25 of 27

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

Publication Year: 2012, Page(s): C2
| PDF (142 KB)
• Computation of Universal Objects for Distributions Over Co-Trees

Publication Year: 2012, Page(s):7021 - 7035
Cited by:  Papers (1)
| | PDF (3073 KB) | HTML

For an ordered set, consider the model of distributionsPfor which an element that precedes another element is considered the more significant one in the sense that the implicationa≤b⇒P(a) ≥P(b) holds. It will be shown that if the ordered set is a finite co-tree, then the universal predictor for the model or, equivalently, the corresponding universal... View full abstract»

• A Linear Program for the Finite Block Length Converse of Polyanskiy–Poor–Verdú Via Nonsignaling Codes

Publication Year: 2012, Page(s):7036 - 7044
Cited by:  Papers (15)
| | PDF (2984 KB) | HTML

Motivated by recent work on entanglement-assisted codes for sending messages over classical channels, the larger, easily characterized class of nonsignaling codes is defined. Analyzing the optimal performance of these codes yields an alternative proof of the finite block length converse of Polyanskiy, Poor, and Verdú, and shows that they achieve this converse. This provides an explicit formulation... View full abstract»

• On the Equivalence Between Stein and De Bruijn Identities

Publication Year: 2012, Page(s):7045 - 7067
Cited by:  Papers (8)
| | PDF (8116 KB) | HTML

This paper focuses on illustrating 1) the equivalence between Stein's identity and De Bruijn's identity, and 2) two extensions of De Bruijn's identity. First, it is shown that Stein's identity is equivalent to De Bruijn's identity under additive noise channels with specific conditions. Second, for arbitrary but fixed input and noise distributions under additive noise channels, the first derivative... View full abstract»

• Upper Bounds of Error Probabilities for Stationary Gaussian Channels With Feedback

Publication Year: 2012, Page(s):7068 - 7072
Cited by:  Papers (3)
| | PDF (1247 KB) | HTML

In this paper, we discuss the coding schemes and error probabilities in information transmission over additive Gaussian noise channels with feedback, where the Gaussian noise processes are stationary but not necessarily white. In the case of the white Gaussian channel it is known that the minimum error probability, under the average power constraint, decreases faster than the exponential of any or... View full abstract»

• The Degraded Poisson Wiretap Channel

Publication Year: 2012, Page(s):7073 - 7085
Cited by:  Papers (7)
| | PDF (3401 KB) | HTML

Optical and near-optical band communication systems are known to be intrinsically more secure than comparable RF channels, due to their narrow beamwidths and, in some cases, their high atmospheric absorption. The use of coding against wiretapping for such channels is investigated. For the degraded Poisson wiretap channel model, the secrecy capacity is determined exactly. Moreover, a complete chara... View full abstract»

• PAC-Bayesian Inequalities for Martingales

Publication Year: 2012, Page(s):7086 - 7093
Cited by:  Papers (6)
| | PDF (1640 KB) | HTML

We present a set of high-probability inequalities that control the concentration of weighted averages of multiple (possibly uncountably many) simultaneously evolving and interdependent martingales. Our results extend the PAC-Bayesian (probably approximately correct) analysis in learning theory from the i.i.d. setting to martingales opening the way for its application to importance weighted samplin... View full abstract»

• Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood

Publication Year: 2012, Page(s):7094 - 7109
Cited by:  Papers (2)
| | PDF (3858 KB) | HTML

We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch. The deinterleaver has access to a sample of the resulting interleaved process, but no knowledge of the number or structure of the component Markov processes, or of the switch. We study conditions for uniqueness of the inter... View full abstract»

• Analysis of a Collaborative Filter Based on Popularity Amongst Neighbors

Publication Year: 2012, Page(s):7110 - 7134
Cited by:  Papers (5)
| | PDF (7023 KB) | HTML

In this paper, we analyze a collaborative filter that answers the simple question: What is popular amongst your “friends”? While this basic principle seems to be prevalent in many practical implementations, there does not appear to be much theoretical analysis of its performance. In this paper, we partly fill this gap. While recent works on this topic, such as the low-rank matrix completion litera... View full abstract»

• Structure Theorems for Real-Time Variable Rate Coding With and Without Side Information

Publication Year: 2012, Page(s):7135 - 7153
Cited by:  Papers (10)
| | PDF (5243 KB) | HTML

The output of a discrete Markov source is to be encoded instantaneously by a variable-rate encoder and decoded by a finite-state decoder. Our performance measure is a linear combination of the distortion and the instantaneous rate. Structure theorems, pertaining to the encoder and next-state functions, are derived for every given finite-state decoder, which can have access to side information. View full abstract»

Publication Year: 2012, Page(s):7154 - 7167
Cited by:  Papers (16)
| | PDF (1572 KB) | HTML

We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the potential aid of relays and cooperation between destinations. The wireless nature of the medium is captured by the broadcast nature of transmissions as well as the superposition of transmitted signals plus independent Gaussian noise at the received signal at an... View full abstract»

• The Diversity-Multiplexing Tradeoff of the MIMO Half-Duplex Relay Channel

Publication Year: 2012, Page(s):7168 - 7187
Cited by:  Papers (6)
| | PDF (5317 KB) | HTML

The fundamental diversity-multiplexing tradeoff of the three-node, multi-input, multi-output (MIMO), quasi-static, Rayleigh faded, half-duplex relay channel is characterized for an arbitrary number of antennas at each node and in which opportunistic scheduling (or dynamic operation) of the relay is allowed, i.e., the relay can switch between receive and transmit modes at a channel dependent time. ... View full abstract»

• The Generalized Degrees of Freedom Region of the MIMO Interference Channel and Its Achievability

Publication Year: 2012, Page(s):7188 - 7203
Cited by:  Papers (27)
| | PDF (4688 KB) | HTML

The generalized degrees of freedom (GDoF) region of the MIMO Gaussian interference channel (IC) is obtained for the general case of an arbitrary number of antennas at each node and where the signal-to-noise ratios (SNRs) and interference-to-noise ratios vary with arbitrary exponents to a nominal SNR. The GDoF-optimal coding scheme involves message splitting and partial interference decoding and co... View full abstract»

• Signal Recovery on Incoherent Manifolds

Publication Year: 2012, Page(s):7204 - 7214
Cited by:  Papers (20)
| | PDF (2378 KB) | HTML

Suppose that we observe noisy linear measurements of an unknown signal that can be modeled as the sum of two component signals, each of which arises from a nonlinear submanifold of a high-dimensional ambient space. We introduce successive projections onto incoherent manifolds (SPIN), a first-order projected gradient method to recover the signal components. Despite the nonconvex nature of the recov... View full abstract»

• On Optimum Parameter Modulation–Estimation From a Large Deviations Perspective

Publication Year: 2012, Page(s):7215 - 7225
Cited by:  Papers (10)
| | PDF (2314 KB) | HTML

We consider the problem of jointly optimum modulation and estimation of a real-valued random parameter, conveyed over an additive white Gaussian noise (AWGN) channel, where the performance metric is the large deviations behavior of the estimator, namely the exponential decay rate (as a function of the observation time) of the probability that the estimation error would exceed a certain threshold. ... View full abstract»

• The Value of Feedback in Decentralized Detection

Publication Year: 2012, Page(s):7226 - 7239
Cited by:  Papers (18)
| | PDF (3390 KB) | HTML

We consider the decentralized binary hypothesis testing problem in networks with feedback, where some or all of the sensors have access to compressed summaries of other sensors' observations. We study certain two-message feedback architectures, in which every sensor sends two messages to a fusion center, with the second message based on full or partial knowledge of the first messages of the other ... View full abstract»

• The Automorphism Group of a Self-Dual$[72, 36, 16]$Binary Code Does Not Contain Elements of Order 6

Publication Year: 2012, Page(s):7240 - 7245
Cited by:  Papers (7)
| | PDF (2001 KB) | HTML

The existence of an extremal code of length 72 is a long-standing open problem. LetCbe a putative extremal code of length 72 and suppose thatChas an automorphismgof order 6. We show thatC, as an \BBF2〈g〉 -module, is the direct sum of two modules; it is easy to determine one of them, while the other one has a very restrictive structure. We use this fact... View full abstract»

• Classification of Poset-Block Spaces Admitting MacWilliams-Type Identity

Publication Year: 2012, Page(s):7246 - 7252
Cited by:  Papers (7)
| | PDF (2388 KB) | HTML

In this paper, we prove that a poset-block space admits a MacWilliams-type identity if and only if the poset is hierarchical, and at any level of the poset, all the blocks have the same dimension. When the poset-block admits the MacWilliams-type identity, we explicitly state the relation between the weight enumerators of a code and its dual. View full abstract»

• The Weight Distributions of Cyclic Codes and Elliptic Curves

Publication Year: 2012, Page(s):7253 - 7259
Cited by:  Papers (40)
| | PDF (2096 KB) | HTML

Cyclic codes with two zeros and their dual codes as a practically and theoretically interesting class of linear codes have been studied for many years and find many applications. The determination of the weight distributions of such codes is an open problem. Generally, the weight distributions of cyclic codes are difficult to determine. Utilizing a class of elliptic curves, this paper determines t... View full abstract»

• Message-Passing Algorithms and Improved LP Decoding

Publication Year: 2012, Page(s):7260 - 7271
Cited by:  Papers (10)
| | PDF (3065 KB) | HTML

Linear programming (LP) decoding for low-density parity-check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its practical performance-coming close to that of iterative decoding algorithms-and its amenability to finite-blocklength analysis. Several works starting with the work of Feldman showed how to analyze LP decoding using p... View full abstract»

• An Efficient Embedder for BCH Coding for Steganography

Publication Year: 2012, Page(s):7272 - 7279
Cited by:  Papers (14)
| | PDF (1319 KB) | HTML

This paper presents an improved data hiding technique based on BCH (<i>n</i>,<i>k</i>,<i>t</i> ) coding. The proposed embedder hides data into a block of input data by modifying some coefficients in the block in order to null the syndrome. The proposed embedder can hide data with less computational time and less storage capacity compared to the existing methods.... View full abstract»

• Robust Distributed Storage of Residue Encoded Data

Publication Year: 2012, Page(s):7280 - 7294
Cited by:  Papers (6)
| | PDF (5473 KB) | HTML

We consider a problem where a physical quantity is repeatedly measured by replicated devices, yielding a stream of numerical data. Data are stored within the measuring devices and sporadically retrieved by a user. To avoid data losses due to large data streams with insufficient memory, the data are split into fragments, each of which is a compressed encoding of a number in the stream, and differen... View full abstract»

• Open Access

Publication Year: 2012, Page(s): 7295
| PDF (1155 KB)
• [Blank page]

Publication Year: 2012, Page(s): 7296
| PDF (5 KB)

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