On asymptotics of certain sums arising in coding theory

DOI10.1109/18.476341MaRDI QIDQ4880343zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Uniform asymptotics of some Abel sums arising in coding theory
• On asymptotics of certain recurrences arising in universal coding
• Bounds on the worst case probability of undetected error
• Publication:4886128

Cited in

(6)

• The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
• On the maximum of the weighted binomial sum \(2^{-r}\sum_{i=0}^r\binom{m}{i}\)
• On some properties of the NML estimator for Bernoulli strings
• Sums of Gauss sums and weights of irreducible codes
• The asymptotic number of solutions of a diophantine equation from coding theory
• Uniform asymptotics of some Abel sums arising in coding theory

This page was built for publication: On asymptotics of certain sums arising in coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880343)