The DMC predictor is a table which maps (bitwise) contexts to a pair of counts, "n"0 and "n"1, representing the number of zeros and ones previously observed in this context. Thus, it predicts that the next bit will be a 0 with probability "p"0 = "n"0 / "n" = "n"0 / ("n"0 + "n"1) and 1 with probability "p"1 = 1 − "p"0 = "n"1 / "n". In addition, each table entry has a pair of pointers to the contexts obtained by appending either a 0 or a 1 to the right of the current context (and possibly dropping bits on the left). Thus, it is never necessary to look up the current context in the table; it is sufficient to maintain a pointer to the current context and follow the links.