M algebraic-coding-theory-notes.pdf → algebraic-coding-theory-notes.pdf

M algebraic-coding-theory-notes.tex → algebraic-coding-theory-notes.tex

@@ -2348,7 +2348,7 @@ Usually $l=1$; if $n=q^m-1$ (ie. $\beta$ a primitive element of $\mathbb{F}_q^m$), then the BCH code is called \emph{primitive}.
 
 
 \begin{thm}{6.6.2}[BCH Bound]
-  the minimum distnce of a BCH code with designed distance $d$ is $\geq d$.
+  the minimum distance of a BCH code with designed distance $d$ is $\geq d$.
 \end{thm}
 \begin{proof}
   wlog. take $l=1$. By Lemma \ref{6.5.4}, the degree of the Mattson-Solomon polynomial $A$ of a codeword $c$ is $deg(A) \leq n-d$.