This is not a consequence of the shannon optimum coding , in which the coding size of a symbol is inversely proportional to the logaritm of the frequency of the symbol?.
What is exactly the comp measure problem? 2012/10/19 Stephen P. King <[email protected]> > Hi, > > I was looking up a definition and found the following: > http://en.wikipedia.org/wiki/**Minimum_description_length<http://en.wikipedia.org/wiki/Minimum_description_length> > "Central to MDL theory is the one-to-one correspondence between code > length functions and probability distributions. (This follows from the > Kraft-McMillan inequality.) For any probability distribution , it is > possible to construct a code such that the length (in bits) of is equal > to ; this code minimizes the expected code length. Vice versa, given a code > , one can construct a probability distribution such that the same holds. > (Rounding issues are ignored here.) In other words, searching for an > efficient code reduces to searching for a good probability distribution, > and vice versa." > > Is this true? Would it be an approach to the measure problem of COMP? > > -- > Onward! > > Stephen > > > -- > You received this message because you are subscribed to the Google Groups > "Everything List" group. > To post to this group, send email to > everything-list@googlegroups.**com<[email protected]> > . > To unsubscribe from this group, send email to everything-list+unsubscribe@ > **googlegroups.com <everything-list%[email protected]>. > For more options, visit this group at http://groups.google.com/** > group/everything-list?hl=en<http://groups.google.com/group/everything-list?hl=en> > . > > -- Alberto. -- You received this message because you are subscribed to the Google Groups "Everything List" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/everything-list?hl=en.
