All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General > Cryptography
Inspector Morse (Posted on 2005-03-20) Difficulty: 3 of 5
......-...-..---...---.-..--.-..--..-.. -.----..-...--..-.-----..-...---.-.....
-.-..-.........-.....--..-....---..---. ....--.-----..-.-----..-.-..-.......-.. .-
.--.-----......-.....-------...-.

See The Solution Submitted by Juggler    
Rating: 4.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Possible methodology | Comment 20 of 23 |

Charlie scanned for long words.
What about this idea:  any word can be put into pauseless Morse, then dit's and dah's can be 0's and 1's, and thus a word becomes a binary number.  Not necessarily unique, for example in Morse without pauses, THAT = BUT = -.....-- = 10000011

Meanwhile, the code above is translated to a long binary number about 200 digits long or so.

Generate a database of words, each paired with it's binary equivalent.   Now sort the database in numerical order according to the binary number.  Now you have a lookup table.

Start at the beginning of the long binary number, match the first n bits with valid entries in the database.  When you get a hit, look at bits n+1 through m.  Still very tedious but a whole lot better than trying to do the same thing one individual letter at a time.


  Posted by Larry on 2005-03-25 23:51:32
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information