StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
text
Body
copied!<h2>Burrows-Wheeler transform</h2> <p>It is also called <strong>block-sorting</strong>. If you do not like reading Wikipedia, then read Mathematical foundations of computer science 1999: <a href="http://books.google.ee/books?id=OcJjpqAi15EC&pg=PA34&lpg=PA34&dq=mathematica+Burrows%E2%80%93Wheeler+transform&source=bl&ots=KaOOIPJcKC&sig=5PzHG9UQeg3opr1FUMq8mPAxfn4&hl=et&ei=Y6vPTLfVFsqCOozvvPcE&sa=X&oi=book_result&ct=result&resnum=1&ved=0CBMQ6AEwAA#v=onepage&q&f=false" rel="nofollow noreferrer">http://books.google.ee/books?id=OcJjpqAi15EC&pg=PA34&lpg=PA34&dq=mathematica+Burrows%E2%80%93Wheeler+transform&source=bl&ots=KaOOIPJcKC&sig=5PzHG9UQeg3opr1FUMq8mPAxfn4&hl=et&ei=Y6vPTLfVFsqCOozvvPcE&sa=X&oi=book_result&ct=result&resnum=1&ved=0CBMQ6AEwAA#v=onepage&q&f=false</a></p> <h2>Huffman coding</h2> <p>For a input of: <code>"this is an example of a huffman tree"</code>. Binary tree like this is built:</p> <p><img src="https://i.stack.imgur.com/Pm69e.png" alt="alt text"></p> <p>It is then used to build coding table:</p> <pre><code> Char ' ' nr(32) | binary:00100000 | new binary:111 Char 'a' nr(97) | binary:01100001 | new binary:001 Char 'e' nr(101) | binary:01100101 | new binary:000 Char 'f' nr(102) | binary:01100110 | new binary:1101 Char 'h' nr(104) | binary:01101000 | new binary:1100 Char 'i' nr(105) | binary:01101001 | new binary:1001 Char 'l' nr(108) | binary:01101100 | new binary:01101 Char 'm' nr(109) | binary:01101101 | new binary:1000 Char 'n' nr(110) | binary:01101110 | new binary:1011 Char 'o' nr(111) | binary:01101111 | new binary:01100 Char 'p' nr(112) | binary:01110000 | new binary:01111 Char 'r' nr(114) | binary:01110010 | new binary:01110 Char 's' nr(115) | binary:01110011 | new binary:1010 Char 't' nr(116) | binary:01110100 | new binary:0101 Char 'u' nr(117) | binary:01110101 | new binary:01001 Char 'x' nr(120) | binary:01111000 | new binary:01000 </code></pre> <p>New binary can only be read, if you have the same tree, so that is also backed in output. Also length of the data is store, because sum of new binary's is not full byte number.</p> <h2>Open software</h2> <p>You can just read </p> <ul> <li>manual pages: <a href="http://www.bzip.org/1.0.5/bzip2-manual-1.0.5.html" rel="nofollow noreferrer">http://www.bzip.org/1.0.5/bzip2-manual-1.0.5.html</a></li> <li>or source : <a href="http://www.bzip.org/1.0.6/bzip2-1.0.6.tar.gz" rel="nofollow noreferrer">http://www.bzip.org/1.0.6/bzip2-1.0.6.tar.gz</a></li> </ul>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload