1 votes 1 votes 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 $2t+1$ $t+1$ $t-1$ $t$ Unknown Category ugcnetcse-nov2017-paper3 + – Arjun asked Nov 5, 2017 edited Jul 6, 2020 by go_editor Arjun 255 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.