On asymptotics of certain sums arising in coding theory

DOI10.1109/18.476341zbMath0849.94025OpenAlexW2167012859MaRDI QIDQ4880343

Wojciech Szpankowski

Publication date: 13 August 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/1197

zbMATH Keywords

asymptotic expansionlinear codessingularity analysisRamanujan's \(Q\)-functionenumeration of treesLagrange's inversion formulaerror detections

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Asymptotic enumeration (05A16) Error probability in coding theory (94B70)

Related Items

Uniform asymptotics of some Abel sums arising in coding theory, The Diagonal Poisson Transform and its application to the analysis of a hashing scheme, On some properties of the NML estimator for Bernoulli strings