In this paper, we prove that for any integer a (1< a<2n), the code A of|A| = a codewords with minimum Hamming weight is an asymptotic optimal solution forthe minimum average Hamming distance problem posed by Ahl...In this paper, we prove that for any integer a (1< a<2n), the code A of|A| = a codewords with minimum Hamming weight is an asymptotic optimal solution forthe minimum average Hamming distance problem posed by Ahlswede and Katona.展开更多
文摘In this paper, we prove that for any integer a (1< a<2n), the code A of|A| = a codewords with minimum Hamming weight is an asymptotic optimal solution forthe minimum average Hamming distance problem posed by Ahlswede and Katona.
