• DocumentCode
    2058226
  • Title

    A system of polynomials for the complex hamming spaces

  • Author

    Levenshtein, Vladimir I.

  • Author_Institution
    Keldysh Inst. of Appl. Math., Moscow
  • fYear
    2004
  • fDate
    2004
  • Firstpage
    358
  • Lastpage
    358
  • Abstract
    It is known that polynomials f(t), such that the matrix f(rho(x,y)) with the Hamming distance rho(x,y) between vectors x=(x 1,...,xn) and y=(y1,...,yn) is nonnegative definite, are described with the help of the system of Krawtchouk polynomials. In the paper the question on the existence of a similar system of polynomials is considered when the function rho(x,y) is not the Hamming distance
  • Keywords
    Hamming codes; algebraic codes; polynomials; Hamming distance; Krawtchouk polynomial; Binary codes; Eigenvalues and eigenfunctions; Hamming distance; Matrix decomposition; Polynomials; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
  • Conference_Location
    Chicago, IL
  • Print_ISBN
    0-7803-8280-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2004.1365395
  • Filename
    1365395