pith. sign in

arxiv: 2604.14042 · v1 · submitted 2026-04-15 · 🧮 math.CO

On the Scalability of Quasi-Complementary Sequence Sets: Quadratic and Cubic Laws

Huaning Liu , Lirong Guo , Zilong Liu This is my paper

Pith reviewed 2026-05-10 12:40 UTC · model grok-4.3

classification 🧮 math.CO
keywords quasi-complementary sequence setsquadratic scaling lawcubic scaling lawcodebook densityasymptotic boundsexplicit constructionstightness factorcorrelation properties
0
0 comments X

The pith

Quasi-complementary sequence sets obey quadratic scaling M ~ K²N when optimal and cubic scaling M ~ K³N² when near-optimal.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper maps any quasi-complementary sequence set to an equivalent complex unit-norm codebook via a geometric embedding. Applying known upper limits on the density of such codebooks then yields polynomial bounds on the QCSS set size M. This produces a quadratic law M ≤ (1+o(1))K²N for asymptotically optimal cases with tightness factor ρ = 1, and a cubic law M ≤ (1+o(1))K³N² for near-optimal cases when ρ is below (1 + √5)/2. Explicit constructions based on additive and mixed characters achieve M = K²N + K and M = K³N² + 2K²N + K respectively, confirming that both laws are asymptotically tight.

Core claim

Through a geometric embedding of QCSSs into unit-norm codebooks and exploitation of codebook density thresholds, asymptotically optimal QCSSs with tightness factor ρ=1 obey the quadratic law M ≤ (1+o(1))K²N, and asymptotically near-optimal QCSSs with ρ < (1+√5)/2 obey the cubic law M ≤ (1+o(1))K³N². Matching constructions confirm the laws are asymptotically tight, and it is conjectured that the cubic law holds for all 1<ρ≤2.

What carries the argument

Geometric embedding that transforms a QCSS into a complex unit-norm codebook, allowing direct transfer of codebook density thresholds to bound the set size M.

If this is right

  • Explicit additive-character constructions achieve M = K²N + K, meeting the quadratic bound up to lower-order terms.
  • Mixed-character constructions achieve M = K³N² + 2K²N + K, meeting the cubic bound up to lower-order terms.
  • The maximum correlation values attained by these constructions are tight, as verified by explicit extremal examples.
  • The quadratic law is sharp for ρ = 1 and the cubic law is sharp for ρ below the golden-ratio threshold.
  • Any QCSS with 1 < ρ ≤ 2 is conjectured to obey the same cubic upper bound M ≤ (1+o(1))K³N².

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Designers of multi-user or radar sequences can treat the cubic bound as a practical limit when choosing flock size K and length N.
  • Attempts to exceed the cubic scaling would require either breaking the unit-norm codebook density limits or showing that the embedding loses correlation information.
  • Computational enumeration for small K and N could test whether the cubic bound continues to hold for tightness factors closer to 2.
  • The same embedding technique may transfer other codebook or packing results to additional families of complementary sequences.

Load-bearing premise

The geometric embedding of a QCSS into a complex unit-norm codebook preserves the correlation properties exactly enough for the known density thresholds of codebooks to apply without additional loss factors.

What would settle it

A concrete QCSS construction whose size exceeds (1+o(1))K³N² for some ρ < (1+√5)/2, or an explicit calculation showing that the embedding step introduces a multiplicative loss that weakens the transferred density bound.

read the original abstract

This work is concerned with the fundamental scaling laws of quasi-complementary sequence sets (QCSSs) by understanding how large the set size (denoted by $M$) can grow with the flock size ($K$) and the sequence length ($N$). We first establish a geometric framework that transforms a QCSS into a complex unit-norm codebook, through which and by exploiting the density thresholds of the codebooks, certain polynomial upper bounds of the QCSS set size are obtained. Sharp quadratic and cubic scaling laws are then introduced. Specifically, we show that asymptotically optimal QCSSs with tightness factor $\rho=1$ satisfy $M \le (1+o(1))K^2N$, while asymptotically near-optimal QCSSs satisfy $M \le (1+o(1))K^3N^2$ for $\rho < {(1+\sqrt{5})}/{2}$. To validate these upper bounds, we further propose explicit additive-character and mixed-character based constructions for QCSSs that achieve $M = K^2N + K$ and $M = K^3N^2 + 2K^2N + K$, respectively, thereby showing that the quadratic and cubic scaling laws are asymptotically tight. Our proposed constructions admit flexible parameter choices, and their maximum correlation estimates are shown to be tight through explicit extremal examples. Additionally, it is conjectured that the cubic scaling law is universal for all $1<\rho\le 2$, i.e., any asymptotically near-optimal QCSSs should satisfy $M \le (1+o(1))K^3N^2$. This identifies a fundamental cubic barrier for QCSS scalability.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper introduces a geometric embedding of quasi-complementary sequence sets (QCSSs) into complex unit-norm codebooks to derive upper bounds on set size M in terms of flock size K and length N. It establishes that asymptotically optimal QCSSs (tightness factor ρ=1) satisfy M ≤ (1+o(1))K²N and asymptotically near-optimal QCSSs satisfy M ≤ (1+o(1))K³N² for ρ < (1+√5)/2. Explicit additive-character and mixed-character constructions achieve M = K²N + K and M = K³N² + 2K²N + K respectively, showing the quadratic and cubic laws are asymptotically tight. A conjecture is stated that the cubic law holds universally for 1 < ρ ≤ 2.

Significance. If the embedding preserves correlations exactly, the work supplies sharp scaling laws for QCSS scalability that connect sequence design to codebook density results. The explicit, parameter-flexible constructions with directly computed tight correlations provide concrete lower bounds that match the upper bounds asymptotically; this is a clear strength. The results identify fundamental quadratic and cubic barriers and are falsifiable via the given constructions.

major comments (2)
  1. [Geometric framework] Geometric framework section: the embedding of a QCSS (flock of K sequences of length N) into a unit-norm codebook must be shown to map the QCSS correlation function exactly onto the codebook inner-product metric with no K- or N-dependent prefactor. Any such scaling would introduce a multiplicative constant into the derived bounds, undermining the claimed (1+o(1)) sharpness relative to the constructions M = K²N + K and M = K³N² + 2K²N + K.
  2. [Upper bounds via density thresholds] Upper-bound derivation (density application): after embedding, the resulting codebook parameters (dimension, minimum distance) must lie in the precise asymptotic regime of the invoked density thresholds without additional loss factors. The manuscript should explicitly verify that the effective regime permits the (1+o(1)) statement without hidden constants.
minor comments (2)
  1. [Conjecture] The conjecture that the cubic law is universal for 1 < ρ ≤ 2 is stated without supporting evidence or partial results; it could be moved to a remarks section or accompanied by a brief discussion of why the golden-ratio threshold appears.
  2. [Throughout] Notation for the tightness factor ρ and the correlation function should be defined once at the outset and used consistently; occasional redefinitions in later sections reduce readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and the recommendation for minor revision. The comments on the geometric embedding and the density threshold application are well taken, and we have revised the manuscript to provide the requested explicit verifications while preserving the (1+o(1)) sharpness of the quadratic and cubic laws.

read point-by-point responses

  1. Referee: Geometric framework section: the embedding of a QCSS (flock of K sequences of length N) into a unit-norm codebook must be shown to map the QCSS correlation function exactly onto the codebook inner-product metric with no K- or N-dependent prefactor. Any such scaling would introduce a multiplicative constant into the derived bounds, undermining the claimed (1+o(1)) sharpness relative to the constructions M = K²N + K and M = K³N² + 2K²N + K.

    Authors: In the geometric framework (Section II), each QCSS flock is embedded by concatenating the K unit-norm sequences of length N into a single vector in ℂ^{KN} and normalizing appropriately. Direct calculation shows that the inner product between two such embedded vectors equals exactly the sum of the K aperiodic cross-correlations (with no multiplicative prefactor in K or N). This follows because each sequence has unit Euclidean norm and the embedding preserves the correlation sum as the standard Hermitian inner product. Consequently, the derived upper bounds inherit the exact (1+o(1)) form without hidden constants, matching the explicit constructions. We have added a short explicit verification paragraph and a displayed equation in the revised Section II to make this mapping transparent. revision: yes

  2. Referee: Upper-bound derivation (density application): after embedding, the resulting codebook parameters (dimension, minimum distance) must lie in the precise asymptotic regime of the invoked density thresholds without additional loss factors. The manuscript should explicitly verify that the effective regime permits the (1+o(1)) statement without hidden constants.

    Authors: After embedding, the codebook lies in dimension D = KN with minimum distance controlled by the tightness factor ρ. In the proofs of the quadratic and cubic laws (Section III), we consider the asymptotic regime where N → ∞ (with K fixed or K = o(N^α) for suitable α). In this regime the normalized minimum distance satisfies the hypotheses of the invoked density theorems (e.g., the asymptotic forms of the Welch or Kabatiansky–Levenshtein bounds) directly, with no multiplicative loss factors. The resulting bounds are therefore precisely M ≤ (1+o(1))K²N and M ≤ (1+o(1))K³N². We have inserted an additional paragraph immediately after the density application that explicitly states the parameter regime, confirms the absence of loss factors, and references the relevant asymptotic statements of the density theorems. revision: yes

Circularity Check

0 steps flagged

No circularity: upper bounds from external codebook densities; constructions explicit and independent.

full rationale

The paper defines a geometric embedding of QCSSs into complex unit-norm codebooks and invokes established external density thresholds to derive the polynomial upper bounds M ≤ (1+o(1))K²N and M ≤ (1+o(1))K³N². These thresholds are not derived within the paper and do not reduce to its own fitted parameters or outputs. The explicit additive- and mixed-character constructions achieving M = K²N + K and M = K³N² + 2K²N + K are parameter-explicit, self-contained, and serve as independent validation rather than being forced by the bounds. No self-definitional steps, fitted-input predictions, or load-bearing self-citations appear in the derivation chain. The central claims therefore rest on independent external results and direct constructions.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on the validity of the geometric embedding and on known density thresholds for complex codebooks; no new free parameters are fitted to data, and no new entities are postulated.

axioms (2)
  • domain assumption The geometric transformation maps QCSS correlation properties exactly onto the inner-product properties of a complex unit-norm codebook
    Invoked to justify applying codebook density thresholds directly to QCSS set-size bounds.
  • standard math Density thresholds for unit-norm codebooks in complex space are known and applicable without additional scaling factors
    Used as the source of the polynomial upper bounds on M.

pith-pipeline@v0.9.0 · 5608 in / 1513 out tokens · 29018 ms · 2026-05-10T12:40:59.403377+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

51 extracted references · 51 canonical work pages

  1. [1]

    Complementary sets of sequences,

    C. C. Tseng, and C. L. Liu, “Complementary sets of sequences,”IEEE Trans. Inf. Theory, vol. 18, no. 5, pp. 644–652, 1972. April 16, 2026 DRAFT 28

    work page 1972

  2. [2]

    N-shift cross-orthogonal sequences,

    N. Suehiro, and M. Hatori, “ N-shift cross-orthogonal sequences,”IEEE Trans. Inf. Theory, vol. 34, no. 1, pp. 143–146, 1988

    work page 1988

  3. [3]

    Complete mutually orthogonal Golay complementary sets from Reed-Muller codes,

    A. Rathinakumar, and A. K. Chaturvedi, “Complete mutually orthogonal Golay complementary sets from Reed-Muller codes,”IEEE Trans. Inf. Theory, vol. 54, no. 3, pp. 1339–1346, 2008

    work page 2008

  4. [4]

    Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed–Muller codes,

    J. A. Davis, and J. Jedwab, “Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed–Muller codes,”IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2397–2417, 1999

    work page 1999

  5. [5]

    New Constructions of General QAM Golay Complementary Sequences,

    Z. Liu, Y . Li, and Y . L. Guan, “New Constructions of General QAM Golay Complementary Sequences,”IEEE Trans. Inf. Theory, vol. 59, no. 11, pp. 7684–7692, Nov. 2013

    work page 2013

  6. [6]

    A multi-carrier CDMA architecture based on orthogonal complementary codes for new generations of wideband wireless communications,

    H. H. Chen, J. F. Yeh, and N. Seuhiro, “A multi-carrier CDMA architecture based on orthogonal complementary codes for new generations of wideband wireless communications,”IEEE Commun. Mag., vol. 39, no. 10, pp. 126–135, Oct. 2001

    work page 2001

  7. [7]

    New complete complementary codes for the peak-to-mean power control in MC-CDMA,

    Z. Liu, Y . L. Guan and U. Parampalli, “New complete complementary codes for the peak-to-mean power control in MC-CDMA,”IEEE Trans. Commun., vol. 62, no. 3, pp. 1105–1113, Mar. 2014

    work page 2014

  8. [8]

    Fractional-delay-resilient receiver for interference-free MC-CDMA communications based on complete complementary codes,

    Z. Liu, Y . L. Guan and H. H. Chen, “Fractional-delay-resilient receiver for interference-free MC-CDMA communications based on complete complementary codes,”IEEE Trans. Wireless Commun., vol. 32, no. 11, pp. 1974–1986, Nov. 2014

    work page 1974

  9. [9]

    MIMO ISI channel estimation using uncorrelated Golay complementary sets of polyphase sequences,

    S. Wang and A. Abdi, “MIMO ISI channel estimation using uncorrelated Golay complementary sets of polyphase sequences,” IEEE Trans. Veh. Technol., vol. 56, no. 5, pp. 3024–3039, 2007

    work page 2007

  10. [10]

    Optimal training sequences for cyclic-prefix-based single-carrier multi-antenna systems with space-time block-coding,

    W. Yuan, Y . Tu, and P. Fan, “Optimal training sequences for cyclic-prefix-based single-carrier multi-antenna systems with space-time block-coding,”IEEE Trans. Wireless Commun., VOL. 7, NO. 11, pp. 4047–4050, Nov. 2008

    work page 2008

  11. [11]

    Doppler resilient Golay complementary waveforms,

    A. Pezeshki, A. R. Calderbank, W. Moran, and S. D. Howard, “Doppler resilient Golay complementary waveforms,”IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 4254–4266, 2008

    work page 2008

  12. [12]

    Construction of Doppler resilient complete complementary code in MIMO radar,

    J. Tan, N. Zhang, and B. Tang, “Construction of Doppler resilient complete complementary code in MIMO radar,”IEEE Trans. Signal Process., vol. 62, no. 18, pp. 4704–4712, Sep. 2014

    work page 2014

  13. [13]

    Doppler Resilient Complementary Sequences: Theoretical Bounds and Optimal Constructions,

    B. Sheng, Y . Yang, Z. Zhou, Z. Liu, and P. Fan, “Doppler Resilient Complementary Sequences: Theoretical Bounds and Optimal Constructions,”IEEE Trans. Inf. Theory, vol. 71, no. 7, pp. 5166–5177, Jul. 2025

    work page 2025

  14. [14]

    Constructions of optimal and near-optimal quasi-complementary sequence sets from singer difference sets,

    Z. Liu, U. Parampalli, Y . L. Guan and S. Boztas, “Constructions of optimal and near-optimal quasi-complementary sequence sets from singer difference sets,”IEEE Wireless Commun. Lett., vol. 2, no. 5, pp. 487–490, 2013

    work page 2013

  15. [15]

    A tighter correlation lower bound for quasi-complementary sequence sets,

    Z. Liu, Y . L. Guan, and W. H. Mow, “A tighter correlation lower bound for quasi-complementary sequence sets,”IEEE Trans. Inf. Theory, vol. 60, no. 1, pp. 388–396, 2014

    work page 2014

  16. [16]

    Construction of a near-optimal quasi-complementary sequence set from almost difference set,

    Y . Li, T. J. Yan, and C. Lv, “Construction of a near-optimal quasi-complementary sequence set from almost difference set,” Cryptogr. Commun., vol. 11, no. 4, pp. 815–824, 2019

    work page 2019

  17. [17]

    Constructions of asymptotically optimal quasi-complementary sequence sets,

    Y . B. Li, T. Liu, and C. Q. Xu, “Constructions of asymptotically optimal quasi-complementary sequence sets,”IEEE Commun. Lett., vol. 22, no. 8, pp. 1516–1519, 2018

    work page 2018

  18. [18]

    Constructions of quasi-complementary sequence sets associated with characters,

    Y . B. Li, L. Y . Tian, T. Liu, and C. Q. Xu, “Constructions of quasi-complementary sequence sets associated with characters,” IEEE Trans. Inf. Theory, vol. 65, no. 7, pp. 4597–4608, 2019

    work page 2019

  19. [19]

    Two constructions of asymptotically optimal quasi-complementary sequence sets,

    Y . B. Li, L. Y . Tian, T. Liu, and C. Q. Xu, “Two constructions of asymptotically optimal quasi-complementary sequence sets,”IEEE Trans. Commun., vol. 67, no. 3, pp. 1910–1924, 2019

    work page 1910

  20. [20]

    Three new constructions of asymptotically optimal periodic quasi- complementary sequence sets with small alphabet sizes,

    G. J. Luo, X. W. Cao, M. J. Shi, and T. Helleseth, “Three new constructions of asymptotically optimal periodic quasi- complementary sequence sets with small alphabet sizes,”IEEE Trans. Inf. Theory, vol. 67, no. 8, pp. 5168–5177, 2021

    work page 2021

  21. [21]

    New constructions of asymptotically optimal quasi-complementary sequence sets with small alphabet sizes,

    H. Y . Xiao, G. J. Luo, and X. W. Cao, “New constructions of asymptotically optimal quasi-complementary sequence sets with small alphabet sizes,”IEEE Trans. Commun., vol. 73, no. 8, pp. 5881–5890, 2025

    work page 2025

  22. [22]

    Large Sets of Quasi-Complementary Sequences From Polynomials over Finite Fields and Gaussian Sums,

    Z. L. Heng, P. Wang, C. L. Xie, and H. Y . Zhou, “Large Sets of Quasi-Complementary Sequences From Polynomials over Finite Fields and Gaussian Sums,”IEEE Trans. Inf. Theory, vol. 72, no. 1, pp. 729–741, 2026. April 16, 2026 DRAFT 29

    work page 2026

  23. [23]

    New constructions of asymptotically optimal periodic and aperiodic quasi-complementary sequence sets,

    P. Wang, Z. L. Heng, and C. J. Li, “New constructions of asymptotically optimal periodic and aperiodic quasi-complementary sequence sets,”IEEE Trans. Commun., vol. 73, no. 12, pp. 14167–14182, Dec. 2025

    work page 2025

  24. [24]

    Lower bounds on the maximum cross-correlation of signals,

    L. R. Welch, “Lower bounds on the maximum cross-correlation of signals,”IEEE Trans. Inf. Theory, vol. 20, no. 3, pp. 397–399, 1974

    work page 1974

  25. [25]

    Grassmannian frames with applications to coding and communication,

    T. Strohmer, and R. W. Heath, “Grassmannian frames with applications to coding and communication,”Appl. Comput. Harmon. Anal., vol. 14, no. 3, pp. 257–275, 2003

    work page 2003

  26. [26]

    Bounds on the maximal cardinality of a code with bounded modules of the inner product,

    V . I. Levenshtein, “Bounds on the maximal cardinality of a code with bounded modules of the inner product,”Soviet Math. Dokl., vol. 25, pp. 526–531, 1982

    work page 1982

  27. [27]

    Bounds for packing of metric spaces and some of their applications,

    V . I. Levenshtein, “Bounds for packing of metric spaces and some of their applications,”Problem Cybern., vol. 40, pp. 43–110, 1983

    work page 1983

  28. [28]

    Packing lines, planes, etc.: Packings in grassmannian spaces,

    J.H. Conway, R.H. Harding, and N. J. A. Sloane, “Packing lines, planes, etc.: Packings in grassmannian spaces,”Exp. Math., vol. 5, no. 2, pp. 139–159, 1996

    work page 1996

  29. [29]

    Optimal codebooks from binary codes meeting the Levenshtein bound,

    C. Xiang, C. Ding, and S. Mesnager, “Optimal codebooks from binary codes meeting the Levenshtein bound,”IEEE Trans. Inf. Theory, vol. 61, no. 12, pp. 6526–6535, 2015

    work page 2015

  30. [30]

    Signal sets from functions with optimum nonlinearity,

    C. Ding, and J. Yin, “Signal sets from functions with optimum nonlinearity,”IEEE Trans. Commun., vol. 55, no. 5, pp. 936–940, 2007

    work page 2007

  31. [31]

    New families of codebooks achieving the Levenstein bound,

    Z. Zhou, C. Ding, and N. Li, “New families of codebooks achieving the Levenstein bound,”IEEE Trans. Inf. Theory, vol. 60, no. 11, pp. 7382–7387, 2014

    work page 2014

  32. [32]

    Optimal codebooks achieving the Levenshtein bound from generalized bent functions over Z4,

    Z. Heng, and Q. Yue, “Optimal codebooks achieving the Levenshtein bound from generalized bent functions over Z4,” Cryptogr. Commun., vol. 9, no. 1, pp. 41–53, 2017

    work page 2017

  33. [33]

    Asymptotically optimal codebooks derived from generalised Bent functions,

    Q. Wang, and Y . Yan, “Asymptotically optimal codebooks derived from generalised Bent functions,”IEEE Access, vol. 8, pp. 54905–54909, 2020

    work page 2020

  34. [34]

    Constructions of codebooks asymptotically achieving the Welch bound with additive characters,

    L. Tian, Y . Li, T. Liu, and C. Xu, “Constructions of codebooks asymptotically achieving the Welch bound with additive characters,”IEEE Signal Process. Lett., vol. 26, no. 4, pp. 622–626, 2019

    work page 2019

  35. [35]

    A new construction of codebooks meeting the Levenshtein bound,

    L. Han, S. Sun, Y . Yan, and Q. Wang, “A new construction of codebooks meeting the Levenshtein bound,”IEEE Access, vol. 8, pp. 77598–77603, 2020

    work page 2020

  36. [36]

    Constructions of codebooks based on additive characters,

    W. Liu, K. CHENG, Q. Wang, Y . Yan, and G. Jin, “Constructions of codebooks based on additive characters,”IEICE Trans. Fundamentals, vol. E108-A, no. 10, pp. 1413–1017, 2015

    work page 2015

  37. [37]

    Near-optimal partial Hadamard codebook construction using binary sequences obtained from quadratic residue mapping,

    S. Hong, H. Park, J. S. No, T. Helleseth, and Y . S. Kim, “Near-optimal partial Hadamard codebook construction using binary sequences obtained from quadratic residue mapping,”IEEE Trans. Inf. Theory, vol. 60, no. 6, pp. 3698–3705, 2014

    work page 2014

  38. [38]

    New constructions of asymptotically optimal codebooks with multiplicative characters,

    Z. Heng, C. Ding, and Q. Yue, “New constructions of asymptotically optimal codebooks with multiplicative characters,” IEEE Trans. Inf. Theory, vol. 63, no. 10, pp. 6179–6187, 2017

    work page 2017

  39. [39]

    Nearly optimal codebooks based on generalized Jacobi sums,

    Z. Heng, “Nearly optimal codebooks based on generalized Jacobi sums,”Dis. Appl. Math., vol. 25, no. 11, pp. 227–240, 2018

    work page 2018

  40. [40]

    A construction of codebooks nearly achieving the Levenshtein bound,

    P. Tan, Z. Zhou, and D. Zhang, “A construction of codebooks nearly achieving the Levenshtein bound,”IEEE Signal Process. Lett., vol. 23, no. 10, pp. 1306–1309, 2016

    work page 2016

  41. [41]

    Two new classes of codebooks asymptotically achieving the Welch bound,

    S. Sun, L. Han, Y . Yan, and Y . Yao, “Two new classes of codebooks asymptotically achieving the Welch bound,”IEEE Access, vol. 9, pp. 5881–5886, 2021

    work page 2021

  42. [42]

    Achieving the Welch bound with difference sets,

    P. Xia, S. Zhou, and G.B. Giannakis, “Achieving the Welch bound with difference sets,”IEEE Trans. Inf. Theory, vol. 51, no. 5, pp. 1900–1907, 2005

    work page 1900

  43. [43]

    Complex codebooks from combinatorial designs,

    C. Ding, “Complex codebooks from combinatorial designs,”IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4229–4235, 2006. April 16, 2026 DRAFT 30

    work page 2006

  44. [44]

    A generic construction of complex codebooks meeting the Welch bound,

    C. Ding, and T. Feng, “A generic construction of complex codebooks meeting the Welch bound,”IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4245–4250, 2007

    work page 2007

  45. [45]

    Two classes of codebooks nearly meeting the Welch bound,

    A. Zhang, and K. Feng, “Two classes of codebooks nearly meeting the Welch bound,”IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2507–2511, 2012

    work page 2012

  46. [46]

    New constructions of codebooks nearly meeting the Welch bound with equality,

    H. Hu, and J. Wu, “New constructions of codebooks nearly meeting the Welch bound with equality,”IEEE Trans. Inf. Theory, vol. 60, no. 2, pp. 1348–1355, 2014

    work page 2014

  47. [47]

    Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum,

    G. Luo, and X. Cao, “Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum,”IEEE Trans. Inf. Theory, vol. 64, no. 10, pp. 6498–6505, 2018

    work page 2018

  48. [48]

    A construction of codebooks associated with binary sequences,

    N. Y . Yu, “A construction of codebooks associated with binary sequences,”IEEE Trans. Inf. Theory, vol. 58, no. 8, pp. 5522–5533, 2012

    work page 2012

  49. [49]

    Incomplete Character Sums and Polynomial Interpolation of the Discrete Logarithm,

    H. Niederreiter, and A. Winterhof, “Incomplete Character Sums and Polynomial Interpolation of the Discrete Logarithm,” Finite Fields Appl., vol. 8, no. 2, pp. 184–192, 2002

    work page 2002

  50. [50]

    Lidl, and H

    R. Lidl, and H. Niederreiter,Finite Fields(Encyclopedia of mathematics and its applications), 2nd ed. Cambridge, U.K., Cambridge Univ. Press, 1997

    work page 1997

  51. [51]

    Gauss sums and the maximum cliques in generalized Paley graphs of square order,

    C. H. Yip, “Gauss sums and the maximum cliques in generalized Paley graphs of square order,”Funct. Approx. Comment. Math., vol. 66, no. 1, pp. 119–138, 2022. April 16, 2026 DRAFT

    work page 2022