An algorithm for asymptotic approximation of Laplace integrals

Computing ◽  
1977 ◽  
Vol 18 (1) ◽  
pp. 51-58 ◽  
Author(s):  
H. -J. Wagner
1989 ◽  
Vol 26 (03) ◽  
pp. 512-523
Author(s):  
Clifton Sutton

Codes having all pairs of words separated by a Hamming distance of at least d are stochastically constructed by sequentially packing randomly generated q-ary n-tuples. Estimates of the random packing densities are obtained by repeated simulation. Using non-linear regression to fit the estimated densities, an asymptotic approximation formula is obtained for the packing densities which depends only on q, n, d, and an empirical constant.


2006 ◽  
Vol 76 (12) ◽  
pp. 1191-1200 ◽  
Author(s):  
Vladimir V. Ulyanov ◽  
Hirofumi Wakaki ◽  
Yasunori Fujikoshi

Sign in / Sign up

Export Citation Format

Share Document