Sciweavers

TIT
2008
92views more  TIT 2008»
13 years 4 months ago
Successive Refinement for Hypothesis Testing and Lossless One-Helper Problem
Abstract--We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H0 : PXY against H1 : PXPY ...
Chao Tian, Jun Chen
TIT
2008
95views more  TIT 2008»
13 years 4 months ago
On the Delay and Throughput Gains of Coding in Unreliable Networks
In an unreliable packet network setting, we study the performance gains of optimal transmission strategies in the presence and absence of coding capability at the transmitter, wher...
Atilla Eryilmaz, Asuman E. Ozdaglar, Muriel M&eacu...
TIT
2008
84views more  TIT 2008»
13 years 4 months ago
Cooperative Multiple-Access Encoding With States Available at One Transmitter
Abstract--We generalize the Gel'fand
Anelia Somekh-Baruch, Shlomo Shamai, Sergio Verd&u...
TIT
2008
106views more  TIT 2008»
13 years 4 months ago
Constrained Sequential Resource Allocation and Guessing Games
In this paper, we consider a constrained sequential resource allocation problem where an individual needs to accomplish a task by repeatedly guessing/investing a sufficient level o...
Nicholas B. Chang, Mingyan Liu
TIT
2008
84views more  TIT 2008»
13 years 4 months ago
Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel
Error correction procedures are considered which are designed specifically for the amplitude damping channel. Amplitude damping errors are analyzed in the stabilizer formalism. Thi...
Andrew S. Fletcher, Peter W. Shor, Moe Z. Win
TIT
2008
127views more  TIT 2008»
13 years 4 months ago
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
Let a biorthogonal Reed
Ilya Dumer, Gregory A. Kabatiansky, Cédric ...
TIT
2008
121views more  TIT 2008»
13 years 4 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
TIT
2008
91views more  TIT 2008»
13 years 4 months ago
Uncoded Transmission Is Exactly Optimal for a Simple Gaussian "Sensor" Network
One of the simplest sensor network models has one single underlying Gaussian source of interest, observed by many sensors, subject to independent Gaussian observation noise. The se...
Michael Gastpar
TIT
2008
61views more  TIT 2008»
13 years 4 months ago
A Probabilistic Upper Bound on Differential Entropy
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
Erik G. Learned-Miller, Joseph DeStefano
TIT
2008
102views more  TIT 2008»
13 years 4 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
Tadashi Wadayama