DocumentCode :
1780158
Title :
On the proof of Lin´s conjecture
Author :
Honggang Hu ; Shuai Shao ; Guang Gong ; Helleseth, Tor
Author_Institution :
Sch. of Inf. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
fYear :
2014
fDate :
June 29 2014-July 4 2014
Firstpage :
1822
Lastpage :
1826
Abstract :
In 1998, Lin presented a conjecture on a class of ternary sequences with ideal 2-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 this 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 Lin conjectured ternary sequences are Hadamard equivalent to ternary m-sequences.
Keywords :
Hadamard transforms; code division multiplexing; combinatorial mathematics; correlation theory; m-sequences; sequential codes; ternary codes; 2-level autocorrelation; Hamming weights; Lin conjectured ternary sequence; Stickelberger theorem; Teichmuller character; combinatorial techniques; mathematical tools; second order multiplexing decimation-Hadamard transform; ternary m-sequences; ternary numbers; Correlation; Cryptography; Educational institutions; Information theory; Multiplexing; Polynomials; Transforms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location :
Honolulu, HI
Type :
conf
DOI :
10.1109/ISIT.2014.6875148
Filename :
6875148
Link To Document :
بازگشت