{
  "id": "1005.2839",
  "version": "v1",
  "published": "2010-05-17T08:40:09.000Z",
  "updated": "2010-05-17T08:40:09.000Z",
  "title": "Construction of Codes for Network Coding",
  "authors": [
    "Andreas-Stephan Elsenhans",
    "Axel Kohnert",
    "Alfred Wassermann"
  ],
  "categories": [
    "cs.IT",
    "math.IT"
  ],
  "abstract": "Based on ideas of K\\\"otter and Kschischang we use constant dimension subspaces as codewords in a network. We show a connection to the theory of q-analogues of a combinatorial designs, which has been studied in Braun, Kerber and Laue as a purely combinatorial object. For the construction of network codes we successfully modified methods (construction with prescribed automorphisms) originally developed for the q-analogues of a combinatorial designs. We then give a special case of that method which allows the construction of network codes with a very large ambient space and we also show how to decode such codes with a very small number of operations.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-05-17T08:40:09.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "construction",
      "network coding",
      "combinatorial designs",
      "network codes",
      "constant dimension subspaces"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1005.2839E"
    }
  }
}