With the help of a copy of , an unknown file can be compressed as follows: again, default characters are inserted at the beginning. For each character , the predictor emits its output based on the previous characters. There will be a such that . The estimate of is given by . The code of , the bitstring , is generated by feeding into the Huffman Coding algorithm (see below). is written into the compressed file.