• DocumentCode
    891980
  • Title

    The linear programming bound for binary linear codes

  • Author

    Brouwer, A.E.

  • Author_Institution
    Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
  • Volume
    39
  • Issue
    2
  • fYear
    1993
  • fDate
    3/1/1993 12:00:00 AM
  • Firstpage
    677
  • Lastpage
    680
  • Abstract
    Combining Delsarte´s (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for dmin (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived
  • Keywords
    error correction codes; linear programming; binary linear codes; linear programming bound; minimum distance; upper bounds; Computer science; Linear code; Linear programming; Mathematics; Table lookup; Upper bound; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.212302
  • Filename
    212302
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=891980