Elements of information theory
Elements of information theory
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
An upper bound for entropy of discrete distributions having assigned moments
Applied Mathematics and Computation
| Hi-index | 0.00 |
Numerical inversion of a one-sided z transform, corresponding to causal positive sequence, is considered. The numerical inversion requires the availability of a finite number of the transform's derivatives. The approximate analytical form is obtained by resorting to the maximum entropy principle. Entropy and then L1-norm convergence are proved.