• DocumentCode
    1975893
  • Title

    Perfect Codes in the Johnson Schemes

  • Author

    Etzion, Tuvi

  • Author_Institution
    Dept. of Comput. Sci., Technion - Israel Inst. of Technol., Haifa
  • fYear
    2006
  • fDate
    13-17 March 2006
  • Firstpage
    47
  • Lastpage
    51
  • Abstract
    In his pioneering work, from 1973, on algebraic approach to codes in association schemes, Dlesarte has conjectured that there are no nontrivial perfect codes in the Johnson schemes. Many attempts were made during the last 30 years to solve this conjecture. These attempts used Lloyd polynomials, anticodes in the Johnson schemes, designs, and number theory. We will survey all the known results and outline directions for solving the problem.
  • Keywords
    codes; number theory; polynomials; Johnson schemes; Lloyd polynomials; algebraic approach; association schemes; number theory; perfect codes; Codes; Computer science; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 2006. ITW '06 Punta del Este. IEEE
  • Conference_Location
    Punta del Este
  • Print_ISBN
    1-4244-0035-X
  • Electronic_ISBN
    1-4244-0036-8
  • Type

    conf

  • DOI
    10.1109/ITW.2006.1633779
  • Filename
    1633779
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1975893