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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
