Strict Minimum Message Length (SMML) is criterion for statistical inference based on information theory. For general statistical models computing the SMML codelength of a model is NP-hard. This function implements the dynamic programming algorithm of Farr and Wallace (see ) that computes the SMML codelength for the binomial distribution in polynomial time. We assume a uniform prior on the probability of success. The algorithm is equivalent to Dijkstra's shortest path algorithm. For details on the algorithm and SMML, please see .
[P, msglen] = smml_binomial(10);
 Farr, G. E.; Wallace, C. S.
The Complexity of Strict Minimum Message Length Inference
Computer Journal; May 2002, Vol. 45 Issue 3, p285
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!