Liu, Zilong and Guan, Yong Liang and Mow, Wai Ho (2011) Improved lower bound for quasi-complementary sequence set. In: 2011 IEEE International Symposium on Information Theory - ISIT, 2011-07-31 - 2011-08-05.
Liu, Zilong and Guan, Yong Liang and Mow, Wai Ho (2011) Improved lower bound for quasi-complementary sequence set. In: 2011 IEEE International Symposium on Information Theory - ISIT, 2011-07-31 - 2011-08-05.
Liu, Zilong and Guan, Yong Liang and Mow, Wai Ho (2011) Improved lower bound for quasi-complementary sequence set. In: 2011 IEEE International Symposium on Information Theory - ISIT, 2011-07-31 - 2011-08-05.
Abstract
The Welch bound for aperiodic correlation for binary sequence set was improved by Levenshtein by weighting the cyclic shifts of the sequence vectors. Taking Levenshtein's idea, a new lower bound for quasi-complementary sequence set (QCSS) over the complex roots-of-unity is derived in this paper. It is shown to be tighter than the Welch bound for QCSS in one of the following cases: 1) K = 4M − 1, M ≥ 2 and equation; 2) K ≥ 4M, M ≥ 2 and N ≥ 2. where K,M,N respectively denotes the set size, number of channels, elementary sequence length of QCSS.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Published proceedings: 2011 IEEE International Symposium on Information Theory Proceedings |
| Uncontrolled Keywords: | Correlation, Copper, Channel estimation, Multiaccess communication, Educational institutions, Power control, Peak to average power ratio |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 27 Aug 2026 10:55 |
| Last Modified: | 27 Aug 2026 10:55 |
| URI: | http://repository.essex.ac.uk/id/eprint/31269 |
Available files
Filename: Improved lower bound for quasi-complementary sequence set.pdf