Uniform asymptotics of some Abel sums arising in coding theory

Authors:
Hsien-Kuei Hwang
Affiliations:
Institute of Statistical Science, Taiwan, ROC
Venue:
Theoretical Computer Science
Year:
2001

Citing 10
Cited 0

An analysis of optimum caching

Journal of Algorithms
Random mapping statistics

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Average-case analysis of algorithms and data structures

Handbook of theoretical computer science (vol. A)
Birthday paradox, coupon collectors, caching algorithms and self-organizing search

Discrete Applied Mathematics
Mellin transforms and asymptotics: harmonic sums

Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
On Ramanujan's Q-function

Journal of Computational and Applied Mathematics
Expected deadlock time in a multiprocessing system

Journal of the ACM (JACM)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On asymptotics of certain sums arising in coding theory

IEEE Transactions on Information Theory - Part 2
Bounds on the worst case probability of undetected error

IEEE Transactions on Information Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

We derive uniform asymptotic expressions of some Abel sums appearing in some problems in coding theory and indicate the usefulness of these sums in other fields, like empirical processes, machine maintenance, analysis of algorithms, probabilistic number theory, queuing models, etc.