Question

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 binary code with minimum distance k, where k is a positive integer, write a program that will detect errors in codewords in as many as {eq}k – 1

{/eq} positions and correct errors in as many as {eq}leftlfloor (k – 1)/2rightrfloor

{/eq} positions.

EXPERT ANSWER

#### Part 1:

On