Entropy computations via analytic depoissonization

DOI10.1109/18.761251zbMATH Open0959.94009OpenAlexW2137601763MaRDI QIDQ4701360FDOQ4701360

Authors: Wojciech Szpankowski, Philippe Jacquet 

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/1339

Recommendations

• Computational analogues of entropy
• On Analytic Properties of Entropy Rate
• Convex analysis and entropy calculation in statistical mechanics
• scientific article; zbMATH DE number 2170418
• Analyticity of the entropy for some random walks
• scientific article
• Analyticity of Entropy Rate of Hidden Markov Chains
• Maximum entropy formalism and analytic extrapolation
• A probabilistic view of De Luca and Termini's entropy
• Entropy and density approximation from Laplace transforms

zbMATH Keywords

binomial distributionShannon entropyPoissonizationanalytic information theoryRényi entropyde Poissonizationentropy evaluation

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17)

Cited In (17)

• Leaf multiplicity in a Bienaym\'e-Galton-Watson tree
• On an asymptotic series of Ramanujan
• Integral representations and asymptotic expansions for Shannon and Renyi entropies
• The Depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace
• Relative Fisher information of discrete classical orthogonal polynomials
• Asymptotic expansions for inverse moments of binomial and negative binomial
• Entropy computing via integration over fractal measures
• Semiquantum key distribution
• On Analytic Properties of Entropy Rate
• Entropy and density approximation from Laplace transforms
• Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality
• On the entropy of a hidden Markov process
• Discrete entropies of orthogonal polynomials
• Entropy and the discrete central limit theorem
• Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures
• ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION
• A generalization of the Erdős-Turán law for the order of random permutation

This page was built for publication: Entropy computations via analytic depoissonization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701360)