Pollux CodeThis page defines the Pollux cipher Theory. With this we use Morse code (see below) to determine a code, and then map a dot, dash or seperator with the following:
For example "GE" becomes "— — ·" and "·", so we can then encode to 180 2 7 9 to give 180279. |
Table
"A" : ".-" "B" : "-..." "C" : "-.-." "D" : "-.." "E" : "." "F" : "..-." "G" : "--." "H" : "...." "I" : ".." "J" : ".---" "K" : "-.-" "L" : ".-.." "M" : "--" "N" : "-." "O" : "---" "P" : ".--." "Q" : "--.-" "R" : ".-." "S" : "..." "T" : "-" "U" : "..-" "V" : "...-" "W" : ".--" "X" : "-..-" "Y" : "-.--" "Z" : "--.." " " : "/"