During the recent BrainBashers cipher convention, a binary code contest took place.
The contest consisted of a binary code transmission where the spaces between the letters were missing and there was no punctuation.
Each letter of the alphabet was translated into its binary equivalent based on its position in the alphabet. The resulting code was then blocked in groups of five digits.
a=1, b=10, c=11, d=100, e=101, f=110, g=111, h=1000, i=1001, j=1010, k=1011, l=1100, m=1101, n=1110, o=1111, p=10000, q=10001, r=10010, s=10011, t=10100, u=10101, v=10110, w=10111, x=11000, y=11001, z=11010
Can you find 10 boy's names?
11010 01011 11010 11
10101 11011 01100 11
10101 10011 11111 110
10011 10100 10110 11010 1
10011 01101 00110 0
10000 10110 10010 11001 0
11100 01001 01001 10011
10101 11111 110
10111 01101 10100 11110
10100 10100 11111 0