Proceedings of the Fourth Mexican International Conference on Computer Science, 2003. ENC 2003.
Download PDF

Abstract

We discuss a set of metrics, which aims to facilitate the formation of symbol groups from a pseudoergodic information source. An optimal codification can then be applied on the symbols(such as Huffman Codes [1]) for zero memory sources where it tends to the theorical limit of compression limited by the entropy. These metrics can be used as a fitness measure of the individuals in the Vasconcelos genetic algorithm as an alternative to exhaustive search.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Related Articles