摘要

It is proved that the size of the symmetry group Sym(C) of every full rank perfect 1-error correcting binary code C of length n is less than or equal to 2 vertical bar Sym(H-n)vertical bar/(n + 1), where H-n is a Hamming code of the same length.

  • 出版日期2012-10-6