Error detection/correction in transmitted data One method for dealing with error

Question

Error detection/correction in transmitted data One method for dealing with errors in transmitted data (1s and 0s) is to replace bit pairs with code words. An example of 8-bit code words used to replace bit pairs in a message are as follows: 00111011 01000111 10101100 11010000 The distance between 2 code words is defined by the number of individual bits that are different between 2 code words. Consider the first 2: 00111011 01000111 OXXXXXOO -> 5 Xs (5 bits are different, thus distance = 5) Create 4 variable that are size (1 times 8): c00 =[0 0111011] c01 =[0 100011 1] c10 =[1010110 0] c11 =[1 101000 0] Write code that compares 2 code words and returns a single value for distance. Next, use the code to build a 4 times 4 matrix of distances between the 4 code words: The diagonal will be zeros since the distance between any code word and itself is 0. Next write code which changes some binary message into its code word equivalent. The message variable 'M' will be size 1 times 2N (even number of values). Create a new coded message variable 'CM' with bit pairs replaced by code words (CM will be 4 times the length of M). Next write an algorithm that decodes CM with some errors present. If a coded bit pair has one error (one flipped bit), it will have a distance 1 from the original code word. For example: c00 = [0 0111011] % The original code word x = 00101011 % Code word with 1 error Your algorithm should correctly decode x as 00 since it has a distance of 1 from c00. Use your code from CODE PART 1 to accomplish this. If a [tolerable number of errors are present, M should be recovered perfectly.

Explanation / Answer

please repost the question as image is not clear

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.