Home/Algebra/Linear codes and error correction/Hamming distance and weight28. Linear codes and error correctionHamming distance and weightLevel: avanzadoIn 28. Linear codes and error correctionFormulaCopy LaTeXdH(x,y)=∣{i:xi≠yi}∣.d_H(\mathbf x,\mathbf y) = |\{i:x_i\neq y_i\}|.dH(x,y)=∣{i:xi=yi}∣.Equivalent formCopy LaTeXwH(x)=dH(x,0).w_H(\mathbf x) = d_H(\mathbf x,\mathbf0).wH(x)=dH(x,0).Tagsalgebracodeslinear codesCSalgebra formulaDetailCounts how many positions differ between two words.Explore the ideaFound an error? Contact us.Related formulasRelatedEuclidean distanced(u,v)=∥u−v∥2d(u,v)=\|u-v\|_2d(u,v)=∥u−v∥2Open formulaOpen in sectionRelatedSyndromes=HrT.\mathbf s=H\mathbf r^T.s=HrT.Open formulaOpen in sectionRelatedMinimum distance, detection, and correctiondmin=minc1≠c2dH(c1,c2).d_{\min} = \min_{\mathbf c_1\neq\mathbf c_2} d_H(\mathbf c_1,\mathbf c_2).dmin=c1=c2mindH(c1,c2).Open formulaOpen in section