{
  "id": "0909.2817",
  "version": "v1",
  "published": "2009-09-15T16:49:58.000Z",
  "updated": "2009-09-15T16:49:58.000Z",
  "title": "Strongly Cancellative and Recovering Sets On Lattices",
  "authors": [
    "ShinnYih Huang",
    "Hoda Bidkhori"
  ],
  "comment": "9 pages",
  "categories": [
    "math.CO",
    "cs.IT",
    "math.IT"
  ],
  "abstract": "We use information theory to study recovering sets $\\R_L$ and strongly cancellative sets $\\C_L$ on different lattices. These sets are special classes of recovering pairs and cancellative sets previously discussed in [1], [3] and [5]. We mainly focus on the lattices $B_n$ and $D_{l}^{k}$. Specifically, we find upper bounds and constructions for the sets $\\R_{B_n}$, $\\C_{B_n}$, and $\\C_{D_{l}^{k}}$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-09-15T16:49:58.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "upper bounds",
      "study recovering sets",
      "special classes",
      "information theory",
      "constructions"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0909.2817H"
    }
  }
}