• DocumentCode
    938596
  • Title

    Packings of R^n by certain error spheres

  • Author

    Stein, Sherman

  • Author_Institution
    IEEE TIT AUTHOR
  • Volume
    30
  • Issue
    2
  • fYear
    1984
  • fDate
    3/1/1984 12:00:00 AM
  • Firstpage
    356
  • Lastpage
    363
  • Abstract
    Golomb in 1969 defined error metrics for codes and their corresponding "error spheres." Among the error spheres are the cross and semicross. The cross is defined as follows. Let k and n be positive integers. The (k, n) -cross in Euclidean n -space R^{n} consists of 2kn + 1 unit cubes: a central cube together with 2n arms of length k . The (k, n) -semicross in R^{n} consists of kn + 1 unit cubes: a comer cube together with n arms of length k attached at n of its nonopposite faces. For instance, the (1, 2) -cross has five squares arranged in a cross and the (1, 2) -semicross is shaped like the letter L . Much has been done on determining when translates of a cross or semicross tile (or tesselate) R^{n} . If translates do not tile, we may ask how densely they can pack space without overlapping. We answer this question for the (k, n) -cross in all dimensions and for k large. We also show that packings by the cross that are extremely regular (lattice packings) do just about as well as arbitrary packings by the cross. However, for the semicross, even in R^{3} , when the arm length k is large, lattice packings are much less dense than arbitrary packings. The methods are primarily algebraic, involving Abelian groups.
  • Keywords
    Coding/decoding; Geometry; Group theory; Arm; Lattices;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1984.1056880
  • Filename
    1056880