Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have