Title :
Quadratic weight vector for tighter aperiodic Levenshtein bound
Author :
Zilong Liu ; Yong Liang Guan ; Parampalli, Udaya ; Boztas, Serdar
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore
Abstract :
The Levenshtein bound, as a function of the weight vector, is only known to be tighter than the Welch bound on aperiodic correlation for K ≥ 4, N ≥ 2, where K and N denoting the set size and the sequence length, respectively. A quadratic weight vector is proposed in this paper which leads to a tighter Levenshtein bound for K ≥ 4, N ≥ 2 and K = 3, N ≥ 4. The latter case was left open by Levensthein.
Keywords :
code division multiple access; correlation methods; radio networks; vectors; Welch bound; aperiodic correlation; asynchronous CDMA communication; quadratic weight vector; sequence length; tighter aperiodic Levenshtein bound; wireless communication; Australia; Correlation; Educational institutions; Electronic mail; Information theory; Optimization; Vectors; CDMA; coding theory; correlation; lower bounds; wireless communications;
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
DOI :
10.1109/ISIT.2013.6620802