[ < ] | [ > ] |  | [ << ] | [ Up ] | [ >> ] |  |  |  |  | [Top] | [Contents] | [Index] | [ ? ]

### 2.2.2 Blocking

After the bit string is obtained as described above, it is grouped into blocks of six. Continuing with the example, the string

    111111101011110010001001100010100010100100100

would be grouped as

    111111 101011 110010 001001 100010 100010 100100 100

Because the number of bits isn’t a multiple of six, the last group has to be padded with zeros, to give

    111111 101011 110010 001001 100010 100010 100100 100000

Each of these six bit substrings is then treated as a binary number, with the most significant bit on the left. The numbers expressed in decimal are

    63 43 50 9 34 34 36 32

The character codes for the characters to be written are obtained by adding sixty to each of these numbers, so as to ensure that they will be printable characters. The resulting character codes are

    123 103 110 69 94 94 96 92

which implies that the tree in the example could be written to a file as `{gnE^^`\`.

This document was generated on November 8, 2012 using texi2html 1.82.