th bit b as the root, indicating a parity violation at any said parity node if the sum modulo 2 of all the bits connected to that node are not zero by placing an X on the bit node at depth 2 of said tree adjacent to that parity node, where X is a symbol representing an uncertain value, producing a left side estimate for the value of the bit at the top of the tree b