Inefficiency of Huffman coding

[姓名]

My previous post "Multiple Huffman code tables" is based on inefficiency of
Huffman coding. Theoretically, two code tables can reduce the bit length of
one code table by an average of one bit, since the two code tables have one
bit of information. My proposal improved the compression ratio by using
this theory. Couldn't this proposal improve the performance of QUIC?