Lempel-Ziv Parsing of Messages from Digram Sources.

Because redundant messages allow greater data compression than complicated messages, any data compression algorithm can be used to discriminate message sources on the basis of message complexity. An earlier study concluded that the Lempel-Ziv parsing algorithm could be useful in discriminating binary memoryless sources, without requiring extremely long test messages. We now study binary diagram sources and reach the same conclusion.