Using compressed bitvector representations and Huffman codes to define the alphabet partitioning, the space usage of the wavelet tree and associated RANK structures of the BWT is bound by H k (T)n + o(n log σ) bits (Grossi et al., 2003).
the space usage is proportional to the order k entropy (H k (T)) of the text.