Richard M. Fredlund

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In coding theory it is widely known that the optimal encoding for a given alphabet of symbol codes is the Shannon entropy times the number of symbols to be encoded. However, depending on the structure of the message to be encoded it is possible to beat this optimal by including only frequently occurring aggregates of symbols from the base alphabet. We prove(More)
  • 1