{
  "id": "2409.07877",
  "version": "v1",
  "published": "2024-09-12T09:34:33.000Z",
  "updated": "2024-09-12T09:34:33.000Z",
  "title": "A new upper bound for codes with a single Hamming distance",
  "authors": [
    "Gábor Hegedüs"
  ],
  "comment": "comments are welcome",
  "categories": [
    "math.CO",
    "math.MG"
  ],
  "abstract": "In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2024-09-12T09:34:33.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05D05",
      "12D99",
      "15A03"
    ],
    "keywords": [
      "single hamming distance",
      "upper bound",
      "linear algebra bound method",
      "short note",
      "application"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}