Uniform asymptotics of some Abel sums arising in coding theory

DOI10.1016/S0304-3975(00)00238-3zbMath0973.68064OpenAlexW2050764392MaRDI QIDQ5941509

Hsien-Kuei Hwang

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00238-3

zbMATH Keywords

Mellin transformsAbel sumscoding theoryMellin functionuniform asymptotics

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Mellin transforms and asymptotics: Harmonic sums
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• The expected linearity of a simple equivalence algorithm
• On asymptotics of certain recurrences arising in universal coding
• Integers without large prime factors
• On the Lambert \(w\) function
• On Ramanujan's \(Q\)-function
• Probabilistic analysis of an algorithm in the theory of markets in indivisible goods
• Singularity Analysis of Generating Functions
• An analysis of optimum caching
• A Recurrence Related to Trees
• Expected deadlock time in a multiprocessing system
• Bounds on the worst case probability of undetected error
• On asymptotics of certain sums arising in coding theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniform asymptotics of some Abel sums arising in coding theory