{
  "id": "1702.06438",
  "version": "v1",
  "published": "2017-02-21T15:30:24.000Z",
  "updated": "2017-02-21T15:30:24.000Z",
  "title": "The meet operation in the imbalance lattice of maximal instantaneous codes: alternative proof of existence",
  "authors": [
    "Stephan Foldes",
    "D. Stott Parker",
    "Sandor Radeleczki"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree of 0-1 words. The proof proposed makes use of a single balancing operation instead of expansion and contraction as in the original proof of the existence of glb.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-02-21T15:30:24.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "06A07",
      "94A45"
    ],
    "keywords": [
      "alternative proof",
      "meet operation",
      "imbalance lattice",
      "greatest lower bounds",
      "infinite binary tree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}