Topic: Information Theory and Coding
The minimum distance of a (n,k)=(7,4) linear block code is upper bounded by:
- A. 1
- B. 2
- C. 3
- D. 4
Answer: D. 4
Explanation: According to the Singleton bound, the minimum distance $d_{min}$ of an $(n,k)$ linear block code is upper bounded by $d_{min} \le n - k + 1$. For a (7,4) code, $d_{min} \le 7 - 4 + 1 = 4$.