The type class contains all length- strings with empirical distribution . Each must be a nonnegative integer and the counts must sum to ; otherwise the class is empty. Distinct type classes partition : every string belongs to exactly one class.
For four binary symbols there are five type classes, indexed by the number of ones. Their cardinalities are , which sum to . The balanced class contains exactly . These are six different strings, not six different empirical distributions.
Sixteen binary strings form five type classes
. An exact enumeration of all four-symbol strings. Each column fixes the number of ones; the central column has six orderings of the same empirical distribution. Details.Write . Arranging copies of each symbol gives the multinomial coefficientThe division by the factorials removes permutations among identical copies. In the balanced four-symbol example, . For binary symbols this becomes the binomial coefficient ; for three symbols with counts , the class contains strings.
If a decoder already knows the length, alphabet and empirical distribution, it only needs to distinguish possible strings. A fixed-length index therefore needs bits. List the six balanced four-symbol strings in increasing lexicographic order and number them through . A three-bit index identifies any one of them, whereas writing the original binary string directly takes four bits.
Knowing the empirical distribution is essential to that calculation. If it must also be sent, a simple fixed-length description of which of the five classes was used costs another bits. That naive balanced-string message totals six bits and is longer than the raw four-bit string. The example demonstrates the benefit of shared constraints, rather than a free lossless source coding scheme for every input. For long strings over a fixed alphabet, the overhead for identifying a class grows only logarithmically with length, while the information entropy of its frequency profile controls the leading cost within the class.
Articles by others on the same topic
There are currently no matching articles.
