Skip to main content
padlock icon - secure page this page is secure

Configurations Maximizing the Number of Pairs of Hamming‐Adjacent Lattice Points

Buy Article:

$59.00 + tax (Refund Policy)

The following question is considered: Which sets of k lattice points among the nd points in a d‐dimensional cube of length n maximize the number of pairs of points differing in only one coordinate? It is shown that maximal configurations for any (d, n, k) are obtained by choosing the first k points in a lexicographic ordering of the points by coordinates. Some possible generalizations of the problem are discussed.
No References
No Citations
No Supplementary Data
No Article Media
No Metrics

Document Type: Research Article

Affiliations: 1: Massachusetts Institute of Technology 2: University of California, Los Angeles

Publication date: June 1, 1971

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more