However, both bind and draw have only one neighbor, which means that only two codewords can be accommodated by these nodes, namely, bits 0 and 1.
the two-bit codeword assigning procedure first loops through all the nodes in Q 1 and then Q 2 .