Answer
The error-correcting code was designed for errors that can be not only detected but also corrected. Here, the table below shows the simple code for the symbols:
using the table in the image below
This code works by the Hamming distance. The Hamming distance between two-bit patterns is the number of bits in which the patterns differ.
The least hamming distance would be the closest match for the bit pattern.
therefore the solution will be:
a. BED
b. CAB
c. HEAD
Work Step by Step
The error-correcting code was designed for errors that can be not only detected but also corrected. Here, the table below shows the simple code for the symbols:
using the table in the image below
This code works by the Hamming distance. The Hamming distance between two-bit patterns is the number of bits in which the patterns differ.
The least hamming distance would be the closest match for the bit pattern.
therefore the solution will be:
a. BED
b. CAB
c. HEAD
