Conference Proceedings
Quadratic weight vector for tighter aperiodic Levenshtein bound
Z Liu, YL Guan, S Boztas, U Parampalli
IEEE International Symposium on Information Theory - Proceedings | IEEE Explore | Published : 2013
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. © 2013 IEEE.
Grants
Awarded by Advanced Communications Research Program
Awarded by Australia-China Group Missions project - Department of Innovation, Industry, Science and Research (DIISR) Australia
Funding Acknowledgements
The work of Zilong Liu and Yong Liang Guan was supported in full by the Advanced Communications Research Program DSOCL06271, a research grant from the Defense Research and Technology Office (DRTech), Ministry of Defence, Singapore. The work of Udaya Parampalli and Serdar Boztas was supported in part by the Australia-China Group Missions project supported by Department of Innovation, Industry, Science and Research (DIISR) Australia, under Grant ACSRF02361.