• DocumentCode
    2445255
  • Title

    Constructing optimal ternary constant-weight codes by placing pieces on chessboards

  • Author

    Svanstrom, Mattias

  • Author_Institution
    Dept. of Electr. Eng., Linkoping Univ., Sweden
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    66
  • Abstract
    We study the problem of constructing optimal ternary constant-weight codes with Hamming weight w and minimum distance d=2w-1. We reformulate the problem as a problem of placing pieces on an M×M chessboard so that three simple conditions are satisfied. Using this, we construct codes with minimal length for a given number of codewords
  • Keywords
    optimisation; ternary codes; Hamming weight; chessboards; code length; code size; codeword matrix; minimal length codes; minimum distance; nonbinary codes; optimal ternary constant-weight codes; Hamming weight; Linear matrix inequalities;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7803-5000-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1998.708649
  • Filename
    708649
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2445255