On asymptotics of certain recurrences arising in universal coding

MaRDI QIDQ1276783zbMATH OpenFDO

Authors Wojciech Szpankowski

Publication date 10 September 2001

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

information theoryLambert \(W\)-functionlinear codesoptimal redundancyRamanujan \(Q\)-functionrecurrent relationstree functionuniversal coding

Mathematics Subject Classification ID

Information theory (general) (94A15) Linear codes (general theory) (94B05)

Recommendations

• On asymptotics of certain sums arising in coding theory
• scientific article; zbMATH DE number 6683480
• On the Lambert \(w\) function

Cited in

(9)

• Hierarchical two-part MDL code for multinomial distributions
• A lower bound on compression of unknown alphabets
• PSEM approximations for both branches of Lambert \(W\) function with applications
• A new recursive universal code of the positive integers
• On asymptotics of certain sums arising in coding theory
• A comparison of automatic histogram constructions
• Uniform asymptotics of some Abel sums arising in coding theory
• Fast and fully-automated histograms for large-scale data sets
• Precise minimax regret for logistic regression with categorical feature values

This page was built for publication: On asymptotics of certain recurrences arising in universal coding

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