{
  "id": "math/9910175",
  "version": "v1",
  "published": "1999-10-31T00:03:37.000Z",
  "updated": "1999-10-31T00:03:37.000Z",
  "title": "Polynomial method in coding and information theory",
  "authors": [
    "A. Ashikhmin",
    "A. Barg",
    "S. Litsyn"
  ],
  "comment": "11 pages",
  "categories": [
    "math.CO",
    "cs.IT",
    "math.IT"
  ],
  "abstract": "Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the applicability of the method was extended to cover a wider range of problems in coding and information theory. In this paper we present a general framework for the method which includes previous results as particular cases. We explain how this generalization leads to new asymptotic bounds on the performance of codes in binary-input memoryless channels and the Gaussian channel, which improve the results of Shannon et al. of 1959-67, and to a number of other results in combinatorial coding theory.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1999-10-31T00:03:37.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "94A24",
      "94B27",
      "05E30",
      "33C45"
    ],
    "keywords": [
      "information theory",
      "polynomial method",
      "coding theory accounts",
      "gaussian channel",
      "binary-input memoryless channels"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1999math.....10175A"
    }
  }
}