Note: Zero indicates a space, 10 and 20 and 21 are Greek alphabets, and character codes higher than 55 are not valid.
# Character Codes
00 01 02 03 04 05 06 07 08 09 ⊔ A B C D E F G H I 10 11 12 13 14 15 16 17 18 19 Δ J K L M N O P Q R 20 21 22 23 24 25 26 27 28 29 Σ Π S T U V W X Y Z 30 31 32 33 34 35 36 37 38 39 0 1 2 3 4 5 6 7 8 9 40 41 42 43 44 45 46 47 48 49 . , ( ) + - * / = $ 50 51 52 53 54 55 < > @ ; : '
The characters above are for the old version. The new version has some Greek alphabets difference: Δ instead of Θ and Σ instead of Φ. Character code 10 is also used to represent a "negative zero" on a card (positions 0 and 11 punched for Hollerith cards). page 
# Decode "10111 01000 00101"
With the specified MIX character codes, e.g. the bit pattern "10111 01000 00101" is to be decoded:
## Break Down the Bit Pattern
1. `10111` -> This is a 5-bit sequence.
2. `01000` -> Another 5-bit sequence.
3. `00101` -> Yet another 5-bit sequence.
## Convert 5-Bit Sequences into Decimal
Now, let's convert each of these 5-bit sequences into decimal: 1. `10111` in decimal is `23`.
2. `01000` in decimal is `8`.
3. `00101` in decimal is `5`.
## Find the Corresponding Characters
Next, let's find the characters corresponding to these decimal values in the provided MIX character code: 1. `23` corresponds to the character 'T'.
2. `8` corresponds to the character 'H'.
3. `5` corresponds to the character 'E'.
Using the MIX character code, the bit pattern `10111 01000 00101` decodes to the characters 'THE'.
~
Practical Algorithm To Retrieve Information Coded In Alphanumeric’s basic idea is to build a binary Trie, but to avoid one-way branching by including in each node the number of bits to skip over before making the next test.