Tech Report CS-91-29
Saddle Point Techniques in Asymptotic Coding Theory
Daniele Gardy and Patrick Sole
Asymptotic estimates on coefficients of generating functions are derived by contour integration. In particular, we obtain Lee analogues of the entropy function both for small and large alphabets. An estimate on the central mements of the Binomial Law allows us to derive an asymptotic upper bound on the covering radius of binary codes of given dual distance.
(complete text in pdf)