UGC NET CSE | November 2017 | Part 3 | Question: 66

Question

For any binary $(n,h)$ linear code with minimum distance $(2t+1)$ or greater $n-h \geq \log_2 \bigg[ \sum \limits_{i=0}^{\alpha} \begin{pmatrix} n \\ i \end{pmatrix} \bigg]$ where $\alpha$ is

• A. $2t+1$
• B. $t+1$
• C. $t-1$
• D. $t$