The Augustin capacity and center
From MaRDI portal
Publication:2190923
Abstract: For any channel, the existence of a unique Augustin mean is established for any positive order and probability mass function on the input set. The Augustin mean is shown to be the unique fixed point of an operator defined in terms of the order and the input distribution. The Augustin information is shown to be continuously differentiable in the order. For any channel and convex constraint set with finite Augustin capacity, the existence of a unique Augustin center and the associated van Erven-Harremoes bound are established. The Augustin-Legendre (A-L) information, capacity, center, and radius are introduced and the latter three are proved to be equal to the corresponding Renyi-Gallager quantities. The equality of the A-L capacity to the A-L radius for arbitrary channels and the existence of a unique A-L center for channels with finite A-L capacity are established. For all interior points of the feasible set of cost constraints, the cost constrained Augustin capacity and center are expressed in terms of the A-L capacity and center. Certain shift invariant families of probabilities and certain Gaussian channels are analyzed as examples.
Recommendations
Cites work
- A class of measures of informativity of observation channels
- A simple derivation of the coding theorem and some applications
- Channels With Cost Constraints: Strong Converse and Dispersion
- Computation of random coding exponent functions
- Generalized cutoff rates and Renyi's information measures
- scientific article; zbMATH DE number 3173999 (Why is no real title available?)
- scientific article; zbMATH DE number 3450081 (Why is no real title available?)
- scientific article; zbMATH DE number 835835 (Why is no real title available?)
- scientific article; zbMATH DE number 7434519 (Why is no real title available?)
- scientific article; zbMATH DE number 3252891 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- scientific article; zbMATH DE number 3405822 (Why is no real title available?)
- Hypothesis testing and information theory
- Information radius
- Information theory. Coding theorems for discrete memoryless systems
- Measure theory. Vol. I and II
- On Pinsker's and Vajda's Type Inequalities for Csiszár's f-Divergences
- Random coding bounds for discrete memoryless channels
- Real Analysis and Probability
- Rényi Divergence and Kullback-Leibler Divergence
- The Rényi Capacity and Center
- The Sphere Packing Bound via Augustin’s Method
Cited in
(4)
This page was built for publication: The Augustin capacity and center
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190923)