Quadratic weight vector for tighter aperiodic Levenshtein bound

Zilong Liu; Yong Liang Guan; Udaya Parampalli; Serdar Boztas

doi:10.1109/ISIT.2013.6620802

Quadratic weight vector for tighter aperiodic Levenshtein bound

Zilong Liu, Yong Liang Guan, Udaya Parampalli, Serdar Boztas

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Citations (Scopus)

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.

Original language	English
Title of host publication	2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages	3130-3134
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2013.6620802
Publication status	Published - 2013
Externally published	Yes
Event	2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey Duration: Jul 7 2013 → Jul 12 2013

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/Territory	Turkey
City	Istanbul
Period	7/7/13 → 7/12/13

ASJC Scopus Subject Areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Keywords

CDMA
coding theory
correlation
lower bounds
wireless communications

Access to Document

10.1109/ISIT.2013.6620802

Cite this

@inproceedings{ca4f7678a0da4af5ba816b85eac53ab3,

title = "Quadratic weight vector for tighter aperiodic Levenshtein bound",

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.",

keywords = "CDMA, coding theory, correlation, lower bounds, wireless communications",

author = "Zilong Liu and Guan, {Yong Liang} and Udaya Parampalli and Serdar Boztas",

year = "2013",

doi = "10.1109/ISIT.2013.6620802",

language = "English",

isbn = "9781479904464",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "3130--3134",

booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",

note = "2013 IEEE International Symposium on Information Theory, ISIT 2013 ; Conference date: 07-07-2013 Through 12-07-2013",

}

Liu, Z, Guan, YL, Parampalli, U & Boztas, S 2013, Quadratic weight vector for tighter aperiodic Levenshtein bound. in 2013 IEEE International Symposium on Information Theory, ISIT 2013., 6620802, IEEE International Symposium on Information Theory - Proceedings, pp. 3130-3134, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620802

Quadratic weight vector for tighter aperiodic Levenshtein bound. / Liu, Zilong; Guan, Yong Liang; Parampalli, Udaya et al.
2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. p. 3130-3134 6620802 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Quadratic weight vector for tighter aperiodic Levenshtein bound

AU - Liu, Zilong

AU - Guan, Yong Liang

AU - Parampalli, Udaya

AU - Boztas, Serdar

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - CDMA

KW - coding theory

KW - correlation

KW - lower bounds

KW - wireless communications

UR - http://www.scopus.com/inward/record.url?scp=84890393316&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890393316&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2013.6620802

DO - 10.1109/ISIT.2013.6620802

M3 - Conference contribution

AN - SCOPUS:84890393316

SN - 9781479904464

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 3130

EP - 3134

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013

Y2 - 7 July 2013 through 12 July 2013

ER -

Quadratic weight vector for tighter aperiodic Levenshtein bound

Abstract

Publication series

Conference

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this