• DocumentCode
    3368677
  • Title

    Translation schemes and LP bounds

  • Author

    Al-Bashabsheh, Ali ; Yongyi Mao ; Chan, Terence H.

  • Author_Institution
    Sch. of Electr. Eng. & Comput. Sci., Univ. of Ottawa, Ottawa, ON, Canada
  • fYear
    2013
  • fDate
    18-21 June 2013
  • Firstpage
    200
  • Lastpage
    204
  • Abstract
    We summarize some results and concepts regarding translation schemes in hope of making such topic more accessible. Two subclasses of translation schemes are of particular interest, namely, the ordered and unordered extension schemes. A linear programming (LP) bound for translation schemes is discussed. Specifying the translation scheme as the ordered extension of the one-class translation scheme, such LP bound reduces to the recently derived LP bound of Chan et al. based on the notion of support enumerator.
  • Keywords
    Hamming codes; linear codes; linear programming; LP bound; linear programming; one-class translation scheme; Conferences; Convolution; Educational institutions; Fourier transforms; Information theory; Linear programming; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (CWIT), 2013 13th Canadian Workshop on
  • Conference_Location
    Toronto, ON
  • Type

    conf

  • DOI
    10.1109/CWIT.2013.6621620
  • Filename
    6621620
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3368677