{
  "id": "1301.6328",
  "version": "v1",
  "published": "2013-01-27T07:28:21.000Z",
  "updated": "2013-01-27T07:28:21.000Z",
  "title": "Explicit Constructions of Quasi-Uniform Codes from Groups",
  "authors": [
    "Eldho K. Thomas",
    "Frederique Oggier"
  ],
  "categories": [
    "math.GR",
    "cs.IT",
    "math.IT"
  ],
  "abstract": "We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian groups. Potentials applications comprise the design of almost affine codes and non-linear network codes.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-01-27T07:28:21.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "explicit constructions",
      "non-linear network codes",
      "potentials applications comprise",
      "constructing explicitly quasi-uniform codes",
      "nonabelian groups"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1301.6328T"
    }
  }
}