On some properties of the NML estimator for Bernoulli strings

DOI10.1016/j.ipl.2003.10.011zbMath1176.94025OpenAlexW2111351483WikidataQ58466692 ScholiaQ58466692MaRDI QIDQ1029082

Ciprian Doru Giurcăneanu

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.10.011

zbMATH Keywords

algorithmsmonotonicityboundscombinatorial problemsnon-asymptotic estimation

Mathematics Subject Classification ID

Other types of codes (94B60) Source coding (94A29)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong optimality of the normalized ML models as universal codes and information in data
• The minimum description length principle in coding and modeling
• Bounds on the worst case probability of undetected error
• Fisher information and stochastic complexity
• On asymptotics of certain sums arising in coding theory
• The enumeration of rooted trees by total height

This page was built for publication: On some properties of the NML estimator for Bernoulli strings