Consider the canonical parity-check matrix h = F 1 1 1 0 1 1 1 0 1 1 0 0 0 1 0 0 0 1 V
Chapter 9, Problem 9(choose chapter or problem)
Consider the canonical parity-check matrix h = F 1 1 1 0 1 1 1 0 1 1 0 0 0 1 0 0 0 1 V a. Prove that the code generated by H is singleerror correcting. b. Write the set of binary m-tuples H encodes and write the code word for each one.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer