Large Sets of Quasi-Complementary Sequences From Polynomials over Finite Fields and Gaussian Sums
Ziling Heng, Peng Wang, Chunlei Xie, Haiyan Zhou

TL;DR
This paper introduces five new families of quasi-complementary sequence sets constructed from polynomials over finite fields and Gaussian sums, achieving near-optimal parameters for multi-carrier communication systems.
Contribution
It presents novel constructions of asymptotically optimal or near-optimal periodic QCSSs with large set sizes and low tolerances, surpassing previous known families in parameters.
Findings
Constructed five new families of QCSSs with large set sizes
Achieved set sizes of BC(K^2) and BC(K^3)
Provided the largest known set sizes for asymptotically optimal QCSSs
Abstract
Perfect complementary sequence sets (PCSSs) are widely used in multi-carrier code-division multiple-access (MC-CDMA) communication systems. However, the set size of a PCSS is upper bounded by the number of row sequences of each two-dimensional matrix in the PCSS. Then quasi-complementary sequence sets (QCSSs) were proposed to support more users in MC-CDMA communications. For practical applications, it is desirable to construct an -QCSS with as large as possible and as small as possible, where is the number of matrices with rows and columns in the set and denotes its periodic tolerance. There exists a tradeoff among these parameters. Constructing QCSSs achieving or nearly achieving the known correlation lower bound has been an interesting research topic. Up to now, only a few constructions of asymptotically…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration
