Abstract
Levenshtein improved the famous Welch bound on aperiodic correlation for binary sequences by utilizing some properties of the weighted mean square aperiodic correlation. Following Levenshtein's idea, a new correlation lower bound for quasi-complementary sequence sets (QCSSs) over the complex roots of unity is proposed in this paper. The derived lower bound is shown to be tighter than the Welch bound for QCSSs when the set size is greater than some value. The conditions for meeting the new bound with equality are also investigated.
| Original language | English |
|---|---|
| Article number | 6626593 |
| Pages (from-to) | 388-396 |
| Number of pages | 9 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 60 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2014 |
| Externally published | Yes |
ASJC Scopus Subject Areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Keywords
- Golay complementary pair
- Levenshtein Bound
- mutually orthogonal complementary sequence set (MOCSS)
- quasi-complementary sequence set (QCSS)
- Welch Bound