摘要
In this paper, we study some packings in a cube, namely, how to pack n points in a cube so as to maximize the minimal distance. The distance is induced by the L1-norm which is analogous to the Hamming distance in coding theory. Two constructions with reasonable parameters are obtained, by using some results from a function field including divisor class group, narrow ray class group, and so on. We also present some asymptotic results of the two packings.
In this paper,we study some packings in a cube,namely,how to pack n points in a cube so as to maximize the minimal distance.The distance is induced by the L_1-norm which is analogous to the Hamming distance in coding theory.Two constructions with reasonable parameters are obtained,by using some results from a function field including divisor class group,narrow ray class group,and so on.We also present some asymptotic results of the two packings.
