Sciweavers

TIT
2008
55views more  TIT 2008»
13 years 11 months ago
On the Performance of Clustering in Hilbert Spaces
Gérard Biau, Luc Devroye, Gábor Lugo...
TIT
2008
95views more  TIT 2008»
13 years 11 months ago
Distributed Estimation Via Random Access
The problem of distributed Bayesian estimation is considered in the context of a wireless sensor network. The Bayesian estimation performance is analyzed in terms of the expected F...
Animashree Anandkumar, Lang Tong, Ananthram Swami
TIT
2008
95views more  TIT 2008»
13 years 11 months ago
Error Exponent Regions for Gaussian Broadcast and Multiple-Access Channels
In modern communication systems, different users have different requirements for quality of service (QoS). In this work, QoS refers to the average codeword error probability experi...
Lihua Weng, S. Sandeep Pradhan, Achilleas Anastaso...
TIT
2008
73views more  TIT 2008»
13 years 11 months ago
Turbo Codes in Binary Erasure Channel
In this correspondence, the stopping set of turbo codes with iterative decoding in the binary erasure channel is defined. Block and bit erasure probabilities of turbo codes are stu...
Jeong Woo Lee, Rüdiger L. Urbanke, Richard E....
TIT
2008
87views more  TIT 2008»
13 years 11 months ago
Performance of Parallel Concatenated Coding Schemes
In this paper we study ensembles of parallel concatenated codes and we present precise results on their asymptotic performance. In particular, we prove that We prove that in any p...
Fabio Fagnani
TIT
2008
83views more  TIT 2008»
13 years 11 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
TIT
2008
78views more  TIT 2008»
13 years 11 months ago
Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
The nonlinearity profile of a Boolean function (i.e. the sequence of its minimum Hamming distances nlr(f) to all functions of degrees at most r, for r 1) is a cryptographic crite...
Claude Carlet
TIT
2008
76views more  TIT 2008»
13 years 11 months ago
Improved Risk Tail Bounds for On-Line Algorithms
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
Nicolò Cesa-Bianchi, Claudio Gentile
TIT
2008
52views more  TIT 2008»
13 years 11 months ago
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frameproof cod...
Douglas R. Stinson, Gregory M. Zaverucha
TIT
2008
224views more  TIT 2008»
13 years 11 months ago
Graph-Based Semi-Supervised Learning and Spectral Kernel Design
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
Rie Johnson, Tong Zhang