title: What EOF character do I use in Burrows Wheeler transform?
body: <p>I'm trying to implement Block Sorting. In the paper Burrows Wheeler Transform, Block Sorting requires appending a k ammount of EOF characters to the original string S, where EOF does not appear in S. </p>
  
  <p>But since I will be processing binary files, there could be any possible combination of bits, so I cant choose in advance a single EOF character that I assure it won't be in S.</p>
  
  <p>How do I solve this?</p>
  
  <p>Since that EOF character is used to sort suffixes in a step, I've read that you can sort a suffix tree without the need of that EOF character. Should I use a suffix tree instead?</p>