Share
Explore BrainMass

Minimum distance of the (3,9) encoding function e and error detection

Coding of Binary Information and Error Detection (IX)
Minimum Distance of the Encoding Function

Consider the (3,9) encoding function e.

e(000) = 000000000
e(001) = 011100101
e(010) = 010101000
e(011) = 110010001
e(100) = 010011010
e(101) = 111101011
e(110) = 001011000
e(111) = 110000111

(a) Find the minimum distance,
(b) How many errors will detect?

Solution Summary

It is for finding the minimum distance of the encoding function. The solution is detailed and well presented.

$2.19