Reed-Solomon code
Suppose that a regular RS code is designed to operate with blocks whose individual symbols are four bits long (so b = 4).
a. What is the total number of symbols (n) in this code?
b. If m = 4 symbols in each block are parity (redundancy) symbols, what is the code's (n, k) specifi cation?
c. How many symbols can the code above correct?
d. Because each symbol contains four bits, does it matter how many of these four bits are wrong for the code to be able to correct a symbol?
e. Why is it said that RS codes are recommended for the correction of error bursts?