dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day!You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Message for dCode's author:

Team dCode read all messages and answer them if you leave an email (not published). It is thanks to you that dCode has the best Burrows–Wheeler Transform tool. Thank you.

How to recognize BWT ciphertext?

How to decipher BWT without key?

The key is not really important for intelligible text, because when decrypting, all lines of the table are in fact rotations of the original text.

What are the variants of the BWT cipher?

BWT can be used without key, but in this case, a unique character of the original text and its position are needed, for instance in computer EOF is used for last one.

What is the complexity of the BWT algorithm?

Several implementations are possible but the best ones are in \( O(n) \) for the duration and \( O(n \log \sigma) \) (or even better) for the memory. With \( n \) the input size and \( \sigma \) the size of the alphabet.