5 11 a 00010 5 12 b 00011 5 13 c 00100 5 14 d 01001 5 15 e 01010 5 16 f 01011 5 in this case the huffman code u201c 1 u201d which has a length of 1 bit is allocated to the data symbol on the other hand the huffman code 011110 which has length of 6 bits is allocated to the substantially less frequently occurring data symbol 6 the allocation can also be illustrated by means of a binary tree as illustrated in fig7 the data symbols forming the u201c leaves u201d of the binary tree the numbers 0 and 1 produce on the path from the top of the tree to the respective data symbol the code allocated to the data symbol in each case read one after the other if the routing header illustrated by way of example is compressed by means of the illustrated huffman code a total length of the compressed header results with respect to the table which indicates which huffman code is allocated to which data symbol u2014 a length of 2166 bits of which 192 bits are allotted to the table by contrast the addresses of the uncompressed routing header alone have a length of 3072 bits corresponding to a gain of 30 5 for longer address tables which can.