Binary Encoding Schemes,

When transmitting information via fixed wireless broadband, rain, snow, and leaves can interfere with microwave transmissions. While other kinds of transmissions can simply detect errors and re-transmit, fixed wireless would most likely suffer from errors in the re-transmission. Thus it is more efficient to correct the errors. You are in the situation of needing to receive a transmission via fixed wireless, but you know the transmission is not secure. Therefore, each character of the message was treated as a decimal number and then converted to Excess-3. The excess-3 word was then converted to a Gray code word. And finally, the code word was encoded using a hamming code. Your job is to write the code that will receive a code word and reverse the process and print out the character. You will need to correct any transmission errors before decoding. Since there is no telling how many characters will be in any given transmission, your program needs to keep reading and decoding and printing characters until there are no more transmissions. We will use extended ASCII characters. Thus a message will require 8 bits - which implies a 12-bit code word. Since you cannot actually read transmissions, we will simulate the transmissions with a file. Specifically, all transmitted code words will be in a file called packets.dat Do NOT have the program ask for ANY input from the user. The program should simply print the message. If you name the input file anything other than packets.dat, you will lose significant points.

C++ no pointers, structs , stl, classes only arrays!

packets.dat

000011110111 000010101010 110010111000 110010111000 010001110010 110011111101 000110011000 001010101010 010110001100 010010111110 100001000011 010001110010 000001110010 000111011101 100010101100 110010100110 100010001111 010001110010 000010101010 010110011101 010001110010 000010001001 110010011011 010110001100 010001110010 100000001111 100010101100 110010100110 110010111000 110001001001 010001110010 110110101100 010010111110 100010101100 010001110010 110010011011 000010001001 110010011000 010110010010 010001110010 110110001010 110010111000 110010100110 000110110101 100010101100 010001110010 010110001100 010010111110 110010100110 010110011100 010001110010 100110111101 100010101100 110010100110 100010001111 010001111010 000110100101 110010100110 000010001001 010001110010 100010101100 000110000010 000010101010 010010011101 010110001100 010001110010 000010101010 010010011111 010001110010 000010101010 000010001001 010001110010 110010011011 110110010101 100010001111 010001110010 010110001100 010010111110 110010011011 110110010100 010110101111 010010111110 010110001100 010010011101 010001110010 110010011011 100110111101 010001110010 010110001100 010010111110 100010101100 010001110010 100110111101 110110010100 010110001100 110110010100 100010001111 100010101100 110001001001 010001110010 100011001010 010110001100 010001110010 000010101010 010010011101 010001110010 110010100110 010001110010 110110001010 100010001111 110010011011 000010110100 110110010100 000110100101 010110001100 010001110010 110010011011 100110111101 010001110010 110010011011 110110010100 100010001111 010001110010 000010101010 000110011000 110010100110 010110101111 000010101010 000010001001 110010100110 010110001100 000010101010 110010011011 000010001001 000001111000 010001110010 000110100101 110010100110 110110010100 010010011101 000010101010 000010001001 010110101111 010001110010 110110010100 010010011101 010001110010 010110001100 110010011011 010001110010 100110111101 100010101100 110010100110 100010001111 010001110010 010110001100 010010111110 000010101010 000010001001 010110101111 010010011101 010001110010 010110001100 010010111110 110010100110 010110001100 010001110010 000010110100 110010011011 010001110010 000010001001 110010011011 010110001100 010001110010 110010100110 010110001100 010001110010 110110001010 100010001111 100010101100 010010011101 100010101100 000010001001 010110001100 010001110010 110010100110 000010001001 000010110100 010001110010 000110011000 110010100110 010110010010 010001110010 000010001001 110010011011 010110001100 010001110010 100010101100 110010000101 100010101100 100010001111 010001110010 100010101100 000110000110 000010101010 010010011101 010110001100 110001001001 010001110010 110111101100 010010111110 110010100110 010110001100 010001110010 000010101010 010010011101 010001110010 000010001001 100010101100 110010100110 100010001111 010001110010 000010101010 000010001001 010010011101 110010100110 000010001001 000010101010 010110001100 010110010010 110001001001 010001110010 100011010100 110010011011 010001110010 000010001001 110010011011 010110001100 010001110010 000110011000 000010101010 010010011101 110110010100 000010001001 000010110100 100010101100 100010001111 010010011101 010110001100 110010100110 000010001001 000010110100 010001110010 000110011000 100010101100 010001110010 000010110100 110010100110 000010001001 010110101111 100010101100 100010001111 010001110010 000010101010 010010011101 010001110010 110010000101 100010101100 100010001111 010110010010 010001110010 100010001111 100010101100 110010100110 110010111000 010001110010 110110110111 110110010100 010110001100 010001110010 100110111101 100010101100 110010100110 100010001111 010001110010 000010101011 010010011111 010001110110 110010101110 010001100010 000110000101 010011111110 110000011011 000110101010 001110100101 110010101100 010001001001

When transmitting information via fixed wireless broadband, rain, snow, and leaves can interfere with microwave transmissions. While other kinds of transmissions can simply detect errors and re-transmit, fixed wireless would most likely suffer from errors in the re-transmission. Thus it is more efficient to correct the errors. You are in the situation of needing to receive a transmission via fixed wireless, but you know the transmission is not secure. Therefore, each character of the message was treated as a decimal number and then converted to Excess-3. The excess-3 word was then converted to a Gray code word. And finally, the code word was encoded using a hamming code. Your job is to write the code that will receive a code word and reverse the process and print out the character. You will need to correct any transmission errors before decoding. Since there is no telling how many characters will be in any given transmission, your program needs to keep reading and decoding and printing characters until there are no more transmissions. We will use extended ASCII characters. Thus a message will require 8 bits which implies a 12-bit code word. Since you cannot actually read transmissions, we will simulate the transmissions with a file Specifically, all transmitted code words will be in a file called