• DocumentCode
    28773
  • Title

    The Proof of Lin’s Conjecture via the Decimation-Hadamard Transform

  • Author

    Honggang Hu ; Shuai Shao ; Guang Gong ; Helleseth, Tor

  • Author_Institution
    Key Lab. of Electromagn. Space Inf., Hefei, China
  • Volume
    60
  • Issue
    8
  • fYear
    2014
  • fDate
    Aug. 2014
  • Firstpage
    5054
  • Lastpage
    5064
  • Abstract
    In 1998, Lin presented a conjecture on a class of ternary sequences with ideal two-level autocorrelation. Those sequences have a very simple structure, i.e., their trace representation has two trace monomial terms. In this paper, we present a proof for the conjecture. The mathematical tools employed are the second-order multiplexing decimation-Hadamard transform, Stickelberger´s theorem, the Teichmüller character, and combinatorial techniques for enumerating the Hamming weights of ternary numbers. As a by-product, we also prove that the ternary sequences conjectured by Lin are Hadamard equivalent to ternary m-sequences.
  • Keywords
    Hadamard transforms; Hamming codes; combinatorial mathematics; m-sequences; multiplexing; ternary codes; Hamming weights; Lin conjecture; Stickelberger theorem; Teichmuller character; combinatorial techniques; decimation-Hadamard transform; ideal two-level autocorrelation; mathematical tools; second-order multiplexing; ternary m-sequences; ternary numbers; trace monomial terms; trace representation; Correlation; Cryptography; Educational institutions; Hamming weight; Multiplexing; Polynomials; Transforms; Teichm??ller character; decimation-Hadamard transform; multiplexing decimation-Hadamard transform; stickelberger??s theorem; two-level autocorrelation;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2014.2327625
  • Filename
    6823744