Inverse Huffman --- Introduction ---

Inverse Huffman is an exercise over the optimal encoding of a system of information, by a code of variable lengths. But the style of the exercise is in the inverse direction: the server gives you a code, and asks you to find a distribution of probabilities such that the given code is optimal.

Choose the parameters of the exercise: size of the system = (between 3 and 52), radix of code = (between 2 and 16). The most recent version
This page is not in its usual appearance because WIMS is unable to recognize your web browser.
In order to access WIMS services, you need a browser supporting forms. In order to test the browser you are using, please type the word wims here: and press ``Enter''.

Please take note that WIMS pages are interactively generated; they are not ordinary HTML files. They must be used interactively ONLINE. It is useless for you to gather them through a robot program.