On asymptotics of certain recurrences arising in universal coding

zbMath0990.94018MaRDI QIDQ1276783

Wojciech Szpankowski

Publication date: 10 September 2001

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

zbMATH Keywords

linear codesinformation theoryuniversal codingLambert \(W\)-functiontree functionrecurrent relationsoptimal redundancyRamanujan \(Q\)-function

Mathematics Subject Classification ID

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

Related Items (6)

Fast and fully-automated histograms for large-scale data sets ⋮ Hierarchical two-part MDL code for multinomial distributions ⋮ A lower bound on compression of unknown alphabets ⋮ Uniform asymptotics of some Abel sums arising in coding theory ⋮ PSEM approximations for both branches of Lambert \(W\) function with applications ⋮ A comparison of automatic histogram constructions

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