Study of Matrix Size for Burrows Wheeler Transformation

From the original and updated thesis paper of M Burrows and D.J. Wheeler [7] it is found that to compress a text, a few sequence of steps should be followed .The sequence of steps are Burrows Wheeler Transformation, Global Structure Transformation, Run Length Encoding, and Entropy Coding. But it was not specified that how much data we can transform through BWT i.e the size of the string that will be transformed. Here we have transformed files with various string and seen that efficiency of BWT scheme increase if the size of the string increases.