Design minimum length (n, k) Hamming code that will detect and correct 2-bit errors in 3-bit long messages. What is the Hamming distance of the code?

To help with hamming code

Add k redundant bits to each m-bit data block to detect errors ( n = m + k)

Construct a set S of n-bit patterns corresponding to each m-bit data block such that the minimum Hamming distance between any two nbit patters in S is d

Set S contains legal n-bit patterns, called code words

Hamming distance of a code is the minimum distance between any two codewords of the code