Chapter 16: Q9E (page 497)
Question: Let C be the (15,7) BCH code of examples 1 and 2. Use the error-correction techniques presented there to correct these received words or to determine that three or more errors have been made.
Chapter 16: Q9E (page 497)
Question: Let C be the (15,7) BCH code of examples 1 and 2. Use the error-correction techniques presented there to correct these received words or to determine that three or more errors have been made.
All the tools & learning materials you need for study success - in one app.
Get started for freeShow that the standard generator matrix
generates the parity-check code in Example 2. [Hint: List all the codewords generated by G; then list all the codewords in the parity-check code; compare the two lists.]
Question 15: Let C be the BCH code of Examples 1 and 2, with codewords written as polynomials of degree . Suppose the codeword c (x)transmitted with errors in the coefficients of and and role="math" localid="1659179965727" is received. Then , whose roots are role="math" localid="1659179995612" and role="math" localid="1659179986054" , is the error-locator polynomial. Express the coeffecients ofD(x)in terms of as follows.
Assume that the probability of transmitting a single digit incorrectly is.01and that M is a 500 -digit message.
(a) What is the probability that M will be transmitted with no errors?
(b) Suppose each digit is transmitted three times (111 for each 1, 000 for
each 0) and that each received digit is decoded by "majority rule" (111,
110, 101, 011 are decoded as 1 and 000, 001, 010,100 as 0 ). What is
the probability that the message received when M is transmitted will be
correctly decoded? [Hint: Find the probability that a single digit will be
correctly decoded after transmission.]
(a) Show that the number of ways that k errors can occur in an digit message is . wheredata-custom-editor="chemistry" is the binomial coefficient.
(b) If p is the probability that a single digit is transmitted incorrectly and q is the probability that it is transmitted correctly, show that the probabilitythat k errors occur in an n-digit message is
If G is a standard generating matrix and is a message word, show that the first k digits of the codeword uG are data-custom-editor="chemistry"
What do you think about this solution?
We value your feedback to improve our textbook solutions.