Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Some properties of generalized exponential entropies with applications to data compression
Luleå tekniska universitet.
Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, Matematiska vetenskaper.
1992 (Engelska)Ingår i: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 62, nr 1, s. 103-132Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

I. Csiszár discussed generalized entropies in his lecture at the Sixth Prague Conference on Information Theory. The authors emphasize that Csiszár noted the link between certain lower bounds for the quantization error and Rényi's differential entropy of order $\alpha$. Another important reference is the paper by L. L. Campbell where the concept of an exponential entropy was introduced. The authors investigate "several consequences that are of interest in the theory of data (or signal) compression". They also "investigate especially the exponential families of distributions, in particular the Miller-Thomas (or generalized Gaussian) family of distributions". The paper is a detailed discussion of the aforementioned problems coupled with examples and details of the possible applications. Exponential entropy is calculated for the uniform distribution, the univariate Gaussian distribution, the Laplace distribution, the Miller-Thomas distribution, an infinite-dimensional Gaussian exponential family, the Gauss-Laplace mixture and the multivariate Gaussian distribution. The extent of a distribution is given for the shape parameter in the Miller-Thomas distribution. Campbell's representation for E$[\alpha, 1 ; f]$ and the connection between an entropy series and data compression are discussed. A lower bound for the entropy of a partition (as defined in the paper) is given. Examples and proofs are illustrated with outputs from Mathematica.

Ort, förlag, år, upplaga, sidor
1992. Vol. 62, nr 1, s. 103-132
Nationell ämneskategori
Matematisk analys
Forskningsämne
Matematik
Identifikatorer
URN: urn:nbn:se:ltu:diva-13738Lokalt ID: d03dd800-b6a3-11db-abff-000ea68e967bOAI: oai:DiVA.org:ltu-13738DiVA, id: diva2:986691
Anmärkning
Godkänd; 1992; 20070207 (evan)Tillgänglig från: 2016-09-29 Skapad: 2016-09-29 Senast uppdaterad: 2017-11-24Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Personposter BETA

Persson, Lars-Erik

Sök vidare i DiVA

Av författaren/redaktören
Persson, Lars-Erik
Av organisationen
Matematiska vetenskaper
I samma tidskrift
Information Sciences
Matematisk analys

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 20 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf