The asymptotic analysis of a class of binomial sums that arise in informati
on theory can be performed in a simple way by means of singularity analysis
of generating functions. The method developed extends the range of applica
bility of singularity analysis techniques to combinatorial sums involving t
ranscendental elements like logarithms or fractional powers. (C) 1999-Elsev
ier Science B.V. All rights reserved.