• DocumentCode
    1485688
  • Title

    Some new constant weight codes

  • Author

    Koschnick, Klaus-Uwe

  • Author_Institution
    Fakultat fuer Math., Bielefeld Univ., West Germany
  • Volume
    37
  • Issue
    2
  • fYear
    1991
  • fDate
    3/1/1991 12:00:00 AM
  • Firstpage
    370
  • Lastpage
    371
  • Abstract
    A(n,d, w) denotes the maximum cardinality of any binary code of length n, minimum distance d, and constant weight w. The results of a search for good constant weight codes using a combinatorial optimization algorithm are reported. A brief description of the algorithm is given. The problem of constructing a constant weight code of length n, minimum distance d, and weight w containing M codewords is mapped to an optimization problem. The algorithm is used to solve the optimization problem for given parameters n, d,w, and M. The application of the algorithm has led to some new constant weight codes. Their parameters are given
  • Keywords
    codes; optimisation; binary code; code length; combinatorial optimization algorithm; constant weight codes; maximum cardinality; minimum distance; Notice of Violation; Reed-Solomon codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.75255
  • Filename
    75255
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1485688