CORR
2010
Springer
13 years 8 months ago
2010
Springer
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this article we prove that given a self-similar interval exchange transformation T(,), whose associated matrix verifies a quite general algebraic condition, there exists an affi...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabil...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We say x {0, 1, 2}N is a word with Sturmian erasures if for any a {0, 1, 2} the word obtained erasing all a in x is a Sturmian word. A large family of such words is given coding ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bo...