Hi!
I have this 2 small assignments. I need it in Java.
1. Given a binary code, determine the number of errors that it can detect and the number of errors that it can correct.
2. Given a binarycode with minimum distance k, where k is a positive integer, write a program that will detect errors in codewords in as many as k −1 positions and correct errors in as many as (k−1)/2 positions.
1
Expert's answer
2020-04-12T22:28:01-0400
Dear Mary, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order
Comments
Leave a comment