I don't think that's a valid argument for informational density. You have to whip up that font where something interesting maps to a low code point and then share it ahead of time before you can take advantage of that alleged density. As an extreme example: if I create a Huffman tree where the bit string "1" maps to the entire concatenated contents of the Library of Congress, does that affect the information density of the Library of Congress?