Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: