{
  "id": "math/0101134",
  "version": "v1",
  "published": "2001-01-16T19:47:37.000Z",
  "updated": "2001-01-16T19:47:37.000Z",
  "title": "Performance evaluation of modulation methods: a combinatorial approach",
  "authors": [
    "Daniel Krob",
    "Ekaterina Vassilieva"
  ],
  "comment": "14 pages Submitted to Formal Power Series and Algebraic Combinatorics 2001",
  "categories": [
    "math.CO"
  ],
  "abstract": "This paper is devoted to the presentation of a combinatorial approach for analyzing the performance of an important modulation protocol used in mobile telecommunications. We show in particular that a fundamental formula, in this context, is in fact highly connected with a slight modification of a very classical algorithm of Knuth that realizes a bijection between pairs of Young tableaux of conjugated shapes and $\\{0,1\\}$-matrices. These new considerations allowed us to obtain the very first results with respect to important specializations (for practical applications) of the performance analysis formula that we studied.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2001-01-16T19:47:37.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05E10",
      "68M20"
    ],
    "keywords": [
      "combinatorial approach",
      "performance evaluation",
      "modulation methods",
      "performance analysis formula",
      "important modulation protocol"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2001math......1134K"
    }
  }
}