### Beyond Countable Alphabets: An Extension of the Information-Spectrum Approach

**2016-02-01**

1602.00376 | cs.IT

A general approach is established for deriving one-shot performance bounds
for information-theoretic problems on general alphabets beyond countable
alphabets. It is mainly based on the quantization idea and a novel form of
"likelihood ratio". As an example, one-shot lower and upper bounds for random
number generation from correlated sources on general alphabets are derived.

**Login to like/save this paper, take notes and configure your recommendations**

# Related Articles

**2018-02-21**

1802.07426 | stat.ML

This paper introduces a novel measure-theoretic theory for machine learning
that does not require st… show more

**2018-06-22**

1806.08837 | math.PR

We investigate the interactions of functional rearrangements with
Prekopa-Leindler type inequalities… show more

**2018-12-08**

1812.03375 | math.LO

This is a survey of constructive and computable measure theory with an
emphasis on the close connect… show more

**2017-01-23**

1701.06347 | cs.IT

The aim of this work is to establish that two recently published projection
theorems, one dealing wi… show more

**2018-10-16**

1810.07278 | math.PR

Let $K_1$, $\dots$, $K_n$ be bounded, complete, separable metric spaces. Let
$\lambda_i$ be a Borel … show more

**2019-01-10**

1901.03048 | cs.CG

Despite the obvious similarities between the metrics used in topological data
analysis and those of … show more

**2017-05-12**

1705.04630 | cs.LG

We consider the task of forecasting an infinite sequence of future
observations based on some number… show more

**2018-11-12**

1811.04757 | cs.CG

Despite strong stability properties, the persistent homology of filtrations
classically used in Topo… show more

**2018-05-23**

1805.09450 | stat.ML

Scalings in which the graph Laplacian approaches a differential operator in
the large graph limit ar… show more

**2017-09-22**

1709.07807 | cs.IT

D. Bennequin and P. Baudot introduced a cohomological construction adapted to
information theory, ca… show more

**2019-05-31**

1905.13619 | math.CO

Guided by the theory of graph limits, we investigate a variant of the cut
metric for limit objects o… show more

**2018-09-27**

1809.10272 | math.PR

Total correlation (`TC') and dual total correlation (`DTC') are two classical
way to quantify the co… show more

**2017-02-20**

1702.05985 | math.ST

We extend Fano's inequality, which controls the average probability of events
in terms of the averag… show more

**2015-04-10**

1504.02730 | math.OA

A C*-algebra is determined to a great extent by the partial order of its
commutative C*-algebras. We… show more

**2016-07-20**

1607.05830 | cs.PL

ProbNetKAT is a probabilistic extension of NetKAT with a denotational
semantics based on Markov kern… show more

**2019-03-16**

1903.06961 | math.NT

Building on work of Kontsevich, we introduce a definition of the entropy of a
finite probability dis… show more

**2018-12-25**

1812.10129 | cs.IT