Acta mathematica scientia,Series A ›› 1999, Vol. 19 ›› Issue (4): 368-372.

• Articles • Previous Articles     Next Articles

On the average hamming distance and variance for binary codes

  

  1. (Department of Mathematics, Nankai University, Tianjin 300071)
  • Online:1999-11-01 Published:1999-11-01

Abstract:

By using the dual distance distribution and its properties for binary code C with length n and number of codewords M, the Althofer-Sillke inequality is improved when M is odd. The exact values of minimum average Hamming distance of C are determined when M equals 2n-1 or 2n-1-1.

Key words:  Hammingdistance, Dualdistancedistribution, Alth¨oferSillkeinequality

CLC Number: 

  • 05C12,05A05,94B15
Trendmd