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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
