Proofs of Existence and Optimality · Application: Error Correcting Codes (Optional)
Lesson 8
Problem. What is the largest number of errors a code (containing at least two codewords) of length \(n\) can correct? Assume that \(n\) is odd.
1 point
Proofs of Existence and Optimality · Application: Error Correcting Codes (Optional)
Problem. What is the largest number of errors a code (containing at least two codewords) of length \(n\) can correct? Assume that \(n\) is odd.