Explore BrainMass
Share

# Coding of Binary Information and Error Detection (III)

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

Coding of Binary Information and Error Detection (III)

Consider the (m,3m) encoding function e: B^m --> B^3m , where m = 4. For each of the received words, determine whether an error will be detected.

(a) 011010011111 (b) 110110010110
(c) 010010110010 (d) 001001111001

https://brainmass.com/computer-science/error-detection-correction/coding-binary-information-error-detection-399224

#### Solution Preview

The solution of the Posting is in the attached files.
One of the solution is written in the docx format and another is in the doc format.

Thanks for using BrainMass.com. Have a great day.

Coding of Binary Information and Error Detection (III)
By:- Thokchom Sarojkumar Sinha

Consider the (m,3m) encoding function e:B^m→B^3m , where m = 4. For each of the received words, determine whether an error will be detected.

011010011111 (b) 110110010110
(c) 010010110010 (d) 001001111001

Solution:- Consider the (m,3m) encoding function e:B^m→B^3m .
If b=b_1 b_2...b_m∈B^m ,
then define
e(b)=e(b_1 b_2...b_m )=b_1 b_2...b_m b_1 b_2...b_m b_1 b_2...b_m .

Thus the encoding function repeats each word of B^m three times.

Let m = ...

#### Solution Summary

This is for solving the problems of Coding of Binary Information and Error Detection. This explains mainly for finding the error of the receiving word after transmission.
It also explained the terms word, encoding function, code word and transmission of a code word.
The solution is given in detail.

\$2.19