pith. sign in

arxiv: 1906.09542 · v1 · pith:ORXNBLYPnew · submitted 2019-06-23 · 💻 cs.IT · math.IT

New Optimal Z-Complementary Code Sets from Matrices of Polynomials

Shibsankar Das , Udaya Parampalli , Sudhan Majhi , Zilong Liu This is my paper

Pith reviewed 2026-05-25 18:10 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords Z-paraunitary matrixZ-complementary code setparaunitary matrixoptimal constructionspolynomial matricescomplementary codesfilter banks
0
0 comments X

The pith

Z-paraunitary matrices generalize paraunitary matrices and correspond directly to Z-complementary code sets when written in polynomial form.

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

The paper introduces Z-paraunitary matrices whose orthogonality condition applies to polynomial entries that share the same degree even when that degree is not maximal. It proves an equivalence between these matrices and Z-complementary code sets expressed with polynomial entries. A single construction framework is then given that produces optimal ZPU matrices and recovers all existing paraunitary matrices as the special case in which the common degree reaches its upper bound. This matters because classical paraunitary matrices are known to exist only under restrictive conditions, so the relaxed definition enlarges the supply of designs available for multi-rate filter banks and related applications in communications.

Core claim

We introduce the Z-paraunitary matrix whose orthogonality is defined over a matrix of polynomials with identical degree not necessarily taking the maximum value. We show that there exists an equivalence between a ZPU matrix and a Z-complementary code set when the latter is expressed as a matrix with polynomial entries. We propose a unifying construction framework for optimal ZPU matrices which includes existing PU matrices as a special case.

What carries the argument

The Z-paraunitary (ZPU) matrix, whose orthogonality condition holds for polynomial entries of identical but possibly non-maximal degree and thereby equates to a Z-complementary code set.

If this is right

  • Optimal Z-complementary code sets are obtained directly from the new construction of ZPU matrices.
  • Properties of ZPU matrices allow systematic extension of matrix sizes and sequence lengths.
  • All previously known paraunitary matrices appear inside the framework when the common polynomial degree is maximal.
  • Applications in cryptography, digital signal processing, and wireless communications gain access to a larger family of designs.

Where Pith is reading between the lines

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

  • The relaxed degree condition may produce complementary sets in length and size regimes where classical PU matrices are provably absent.
  • The matrix-polynomial representation could be used to import filter-bank design techniques into the construction of new Z-complementary codes.
  • Further relaxations of the identical-degree requirement might yield additional classes of complementary objects.

Load-bearing premise

The claimed equivalence between a ZPU matrix and a Z-complementary code set holds when the code set is expressed as a matrix with polynomial entries.

What would settle it

A Z-complementary code set written as a matrix of polynomials of common degree that fails to satisfy the Z-paraunitary orthogonality condition would refute the claimed equivalence.

Figures

Figures reproduced from arXiv: 1906.09542 by Shibsankar Das, Sudhan Majhi, Udaya Parampalli, Zilong Liu.

Figure 1
Figure 1. Figure 1: Relationship between ZPU matrix and PU matrix [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Relationship between ZPU matrix and ZCCS [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The time-domain expression of Xg(z) · X(z) for a ZPU matrix X(z). For the given two matrices of polynomials X(z) and Y(z) with size M1×K1, and M2×K2, respectively, their Kronecker product X(z) ⊗ Y(z) is also a matrix of polynomials with size M1M2 × K1K2 [10]. According to the tilde operation, we have X(z^) ⊗ Y(z) = Xg(z) ⊗ Yg(z), (30) where ⊗ denotes Kronecker product. Let X(z), Y(z),Z(z), and T(z) be four… view at source ↗
read the original abstract

The concept of paraunitary (PU) matrices arose in the early 1990s in the study of multi-rate filter banks. So far, these matrices have found wide applications in cryptography, digital signal processing, and wireless communications. Existing PU matrices are subject to certain constraints on their existence and hence their availability is not guaranteed in practice. Motivated by this, for the first time, we introduce a novel concept, called $Z$-paraunitary (ZPU) matrix, whose orthogonality is defined over a matrix of polynomials with identical degree not necessarily taking the maximum value. We show that there exists an equivalence between a ZPU matrix and a $Z$-complementary code set when the latter is expressed as a matrix with polynomial entries. Furthermore, we investigate some important properties of ZPU matrices, which are useful for the extension of matrix sizes and sequence lengths. Finally, we propose a unifying construction framework for optimal ZPU matrices which includes existing PU matrices as a special case.

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

0 major / 2 minor

Summary. The paper introduces Z-paraunitary (ZPU) matrices, a relaxation of paraunitary matrices in which orthogonality holds for polynomial entries of identical (but not necessarily maximal) degree. It claims an equivalence between ZPU matrices and Z-complementary code sets when the latter are written in polynomial-matrix form, derives extension properties for matrix size and sequence length, and presents a unifying construction of optimal ZPU matrices that recovers ordinary PU matrices as the special case of maximal polynomial degree.

Significance. If the equivalence and construction are valid, the work supplies a flexible, unifying framework for optimal Z-complementary code sets that relaxes existence constraints of classical PU matrices while recovering prior constructions. This could benefit applications in filter banks, communications, and coding theory; the explicit inclusion of known PU matrices as a special case is a positive feature.

minor comments (2)
  1. The abstract asserts an equivalence and a construction but does not indicate where in the manuscript the explicit mapping between ZPU matrices and Z-complementary sets is proved; a forward reference to the relevant section or theorem would improve readability.
  2. Notation for the common polynomial degree and the precise orthogonality condition for ZPU matrices should be introduced with a displayed definition early in the paper to avoid ambiguity when the construction is later presented.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the supportive summary, positive significance assessment, and recommendation of minor revision. Since no specific major comments were provided in the report, we have no points to address individually at this stage. We will incorporate any minor suggestions during revision.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper introduces a new ZPU matrix definition whose orthogonality condition is stated directly over polynomial matrices of non-maximal common degree. It then derives an equivalence to Z-complementary code sets under the polynomial-matrix representation, lists extension properties as consequences of that definition, and presents a construction that recovers ordinary PU matrices when the degree parameter reaches its maximum. None of these steps reduces by construction to a fitted parameter, a self-citation chain, or a renaming of an input quantity; optimality is asserted by reference to external known bounds on Z-complementary sets rather than an internal fit. The provided abstract and skeptic summary contain no load-bearing self-citation or self-definitional loop.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 1 invented entities

Abstract-only review prevents identification of concrete free parameters or axioms; the central claim rests on the stated equivalence and existence of the construction.

invented entities (1)
  • Z-paraunitary matrix no independent evidence
    purpose: Relax orthogonality condition of paraunitary matrices to equal-degree polynomials over a finite window
    Introduced for the first time in the abstract as a novel concept

pith-pipeline@v0.9.0 · 5712 in / 986 out tokens · 21355 ms · 2026-05-25T18:10:33.035468+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

57 extracted references · 57 canonical work pages · 1 internal anchor

  1. [1]

    P. P. Vaidyanathan, Multi-Rate Systems and Filter Banks . Prentice Hall, 1993

    work page 1993

  2. [2]

    Paraunitary filter banks over finite fields,

    S. M. Phoong and P. P. Vaidyanathan, “Paraunitary filter banks over finite fields,” IEEE Trans. Signal Process. , vol. 45, no. 6, pp. 1443–1457, Jun. 1997

    work page 1997

  3. [3]

    Spreading sequence design via perfect-reconstruction filter banks,

    E. Kofidis and P. A. Regalia, “Spreading sequence design via perfect-reconstruction filter banks,” CiteSeerX, 2014

    work page 2014

  4. [4]

    Strang and T

    G. Strang and T. Q. Nguyen, Wavelets and Filterbanks. Wellesley, MA: Wellesley-Cambridge, 1997

    work page 1997

  5. [5]

    Short wavelets and matrix dilation equations,

    G. Strang and V . Strela, “Short wavelets and matrix dilation equations,” IEEE Trans. Signal Process. , vol. vol. 43, pp. 108–115, Jan. 1995

    work page 1995

  6. [6]

    Orthogonal multiwavelets with optimum time-frequency resolution,

    Q. T. Jiang, “Orthogonal multiwavelets with optimum time-frequency resolution,” IEEE Trans. Signal Process., vol. vol. 46, pp. 830–844, Apr. 1998

    work page 1998

  7. [7]

    Kailath, Linear Systems

    T. Kailath, Linear Systems. Prentice-Hall Englewood Cliffs, NJ, 1980, vol. 156

    work page 1980

  8. [8]

    An EVD algorithm for para-hermitian polynomial matrices,

    J. G. McWhirter, P. D. Baxter, T. Cooper, S. Redif, and J. Foster, “An EVD algorithm for para-hermitian polynomial matrices,” IEEE Trans. Signal Process., vol. 55, no. 5, pp. 2158–2169, May 2007

    work page 2007

  9. [9]

    Public-key cryptography using paraunitary matrices,

    F. Delgosha and F. Fekri, “Public-key cryptography using paraunitary matrices,” IEEE Trans. Signal Process. , vol. 54, no. 9, pp. 3489–3504, Sep. 2006

    work page 2006

  10. [10]

    Antipodal paraunitary matrices and their application to OFDM systems,

    S. M. Phoong and K.-Y . Chang, “Antipodal paraunitary matrices and their application to OFDM systems,” IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1374–1386, Apr. 2005

    work page 2005

  11. [11]

    Method of handling antipodal parauitary precoding for MIMO-OFDM and related communication device,

    Y . C. Jen, S. M. Phoong, Y . H. Chung, and H. J. Su, “Method of handling antipodal parauitary precoding for MIMO-OFDM and related communication device,” Oct. 2012, US Patent App. 13/271,258. [Online]. Available: https://www.google.com/patents/US20120269284

    work page 2012

  12. [12]

    Spread-signature CDMA: efficient multiuser communication in the presence of fading,

    G. W. Wornell, “Spread-signature CDMA: efficient multiuser communication in the presence of fading,” IEEE Trans. Inf. Theory , vol. 41, no. 5, pp. 1418–1438, Sep. 1995

    work page 1995

  13. [13]

    Paraunitary generation/correlation of QAM complementary sequence pairs,

    S. Z. Budi ˇsin and P. Spasojevi ´c, “Paraunitary generation/correlation of QAM complementary sequence pairs,” in Proc. Cryptography and Communications 6.1 , Oct. 2014, pp. 59–102

    work page 2014

  14. [14]

    A new method to construct Golay complementary set by paraunitary matrices and Hadamard matrices,

    Z. Wang, G. Wu, and D. Ma, “A new method to construct Golay complementary set by paraunitary matrices and Hadamard matrices,” in Proc. 9th International Conference on Sequences and Their Applications (SETA-2016) , Sep. 2016, pp. 1–12

    work page 2016

  15. [15]

    A novel multiplier-free generator for complete complementary codes,

    S. Das, S. Majhi, S. Budi ˇsin, Z. Liu, and Y . L. Guan, “A novel multiplier-free generator for complete complementary codes,” in Proc. 23rd Asia-Pacific Conference on Communications (APCC) , Dec. 2017

    work page 2017

  16. [16]

    A multiplier-free generator for polyphase complete complementary codes,

    S. Das, S. Budi ˇsin, S. Majhi, Z. Liu, and Y . L. Guan, “A multiplier-free generator for polyphase complete complementary codes,” IEEE Trans. Signal Process., vol. 66, no. 5, pp. 1184–1196, Nov. 2017

    work page 2017

  17. [17]

    Paraunitary-based Boolean generator for QAM complementary sequences of length 2K,

    S. Z. Budi ˇsin and P. Spasojevi´c, “Paraunitary-based Boolean generator for QAM complementary sequences of length 2K,” IEEE Trans. Inf. Theory, vol. 64, no. 8, pp. 5938–5956, Aug. 2018

    work page 2018

  18. [18]

    An improved multiplier-free generator for polyphase complete complementary codes,

    S. Das, S. Majhi, and P. Sarkar, “An improved multiplier-free generator for polyphase complete complementary codes,” in Proc. 10th International Conference on Sequences and Their Applications (SETA-2018) , Oct. 2018, pp. 1–12

    work page 2018

  19. [19]

    A new generalized paraunitary generator for complementary sets and complete complementary codes of size 2m,

    D. Ma, S. Budi ˇsin, Z. Wang, and G. Gong, “A new generalized paraunitary generator for complementary sets and complete complementary codes of size 2m,” IEEE Signal Process. Lett. , vol. 26, no. 1, pp. 4–8, Oct. 2018

    work page 2018

  20. [20]

    A novel class of complete complementary codes and their applications for APU matrices,

    S. Das, S. Majhi, and Z. Liu, “A novel class of complete complementary codes and their applications for APU matrices,” IEEE Signal Process. Lett., vol. 25, no. 9, pp. 1300–1304, Jul. 2018

    work page 2018

  21. [21]

    Multislit spectroscopy,

    M. J. E. Golay, “Multislit spectroscopy,” J. Opt. Soc. Amer. , vol. 39, pp. 437–444, 1949

    work page 1949

  22. [22]

    Complementary Series,

    ——, “Complementary Series,” IRE Trans. Inf. Theory , vol. IT-7, no. 2, pp. 82–87, Apr. 1961

    work page 1961

  23. [23]

    A Radix-M Construction for Complementary Sets

    S. Z. Budi ˇsin, “A radix-M construction for complementary sets,” ArXiv e-prints , pp. 1–12, Aug. 2018. [Online]. Available: https://arxiv.org/pdf/1808.10400.pdf

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  24. [24]

    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, Jan. 1988

    work page 1988

  25. [25]

    Modular architecture for efficient generation and correlation of complementary set of sequences,

    C. D. Marziani and et al. , “Modular architecture for efficient generation and correlation of complementary set of sequences,” IEEE Trans. Signal Process., vol. 55, no. 5, pp. 2323–2337, May 2007

    work page 2007

  26. [26]

    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, Mar. 2008. 24

    work page 2008

  27. [27]

    A systematic framework for the construction of optimal complete complementary codes,

    C. Han, N. Suehiro, and T. Hashimoto, “A systematic framework for the construction of optimal complete complementary codes,” IEEE Trans. Inf. Theory , vol. 57, no. 9, pp. 6033–6042, Sep. 2011

    work page 2011

  28. [28]

    A new construction framework for polyphase complete complementary codes with various lengths,

    S. Das, S. Majhi, S. Budi ˇsin, and Z. Liu, “A new construction framework for polyphase complete complementary codes with various lengths,” IEEE Trans. Signal Process. , vol. 67, no. 10, pp. 2639–2648, Mar. 2019

    work page 2019

  29. [29]

    Near-optimal zero correlation zone sequence sets from paraunitary matrices,

    S. Das, U. Parampalli, S. Majhi, and Z. Liu, “Near-optimal zero correlation zone sequence sets from paraunitary matrices,” in Proc. IEEE Int. Sym. Inf. Theory (ISIT-2019), Accepted , Jul. 2019, pp. 1–5

    work page 2019

  30. [30]

    A multicarrier CDMA architecture based on orthogonal complementary codes for new generations of wide band wireless communications,

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

    work page 2001

  31. [31]

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

    Z. Liu, Y . L. Guan, and H. Chen, “Fractional-delay-resilient receiver design for interference-free MC-CDMA communications based on complete complementary codes,” IEEE Trans. Wireless Commun. , vol. 14, no. 3, pp. 1226–1236, Mar. 2015

    work page 2015

  32. [32]

    An audio data hiding based on complete complementary codes and its application to an evacuation guiding system,

    T. Kojima, A. Oizumi, K. Okayasu, and U. Parampalli, “An audio data hiding based on complete complementary codes and its application to an evacuation guiding system,” in Proc. IEEE IWSDA, Oct. 2013, pp. 118–121

    work page 2013

  33. [33]

    A disaster prevention broadcasting based on data hiding scheme using complete complementary codes,

    T. Kojima, T. Tachikawa, A. Oizumi, Y . Yamaguchi, and U. Parampalli, “A disaster prevention broadcasting based on data hiding scheme using complete complementary codes,” in 2014 Int. Symp. Inf. Theory and its Applications , Oct. 2014, pp. 45–49

    work page 2014

  34. [34]

    Z-complementary binary sequences,

    P. Fan, W. Yuan, and Y . Tu, “Z-complementary binary sequences,” IEEE Signal Process. Lett. , vol. 14, no. 8, pp. 509–512, Aug. 2007

    work page 2007

  35. [35]

    Chen, The Next Generation CDMA Technologies

    H.-H. Chen, The Next Generation CDMA Technologies . John Wiley & Sons Ltd, 2007

    work page 2007

  36. [36]

    Optimal binary periodic almost-complementary pairs,

    A. R. Adhikary, Z. Liu, Y . L. Guan, S. Majhi, and S. Z. Budishin, “Optimal binary periodic almost-complementary pairs,” IEEE Signal Process. Lett., vol. 23, no. 12, pp. 1816–1820, Dec. 2016

    work page 2016

  37. [37]

    Existence of binary Z-complementary pairs,

    X. Li, P. Fan, X. Tang, and Y . Tu, “Existence of binary Z-complementary pairs,” IEEE Signal Process. Lett. , vol. 18, no. 1, pp. 63–66, Jan. 2011

    work page 2011

  38. [38]

    On even-period binary Z-complementary pairs with large ZCZs,

    Z. Liu, U. Parampalli, and Y . L. Guan, “On even-period binary Z-complementary pairs with large ZCZs,” IEEE Signal Process. Lett. , vol. 21, no. 3, pp. 284–287, Mar. 2014

    work page 2014

  39. [39]

    Optimal odd-length binary Z-complementary pairs,

    ——, “Optimal odd-length binary Z-complementary pairs,” IEEE Trans. Inf. Theory , vol. 60, no. 9, pp. 5768–5781, Sep. 2014

    work page 2014

  40. [40]

    New construction of Z-complementary pairs,

    X. Li, W. H. Mow, and X. Niu, “New construction of Z-complementary pairs,” Electron. Lett., vol. 52, no. 8, pp. 609–611, 2016

    work page 2016

  41. [41]

    A novel construction of Z-complementary pairs based on generalized Boolean functions,

    C. Chen, “A novel construction of Z-complementary pairs based on generalized Boolean functions,” IEEE Signal Process. Lett., vol. 24, no. 7, pp. 987–990, Jul. 2017

    work page 2017

  42. [42]

    New sets of even-length binary Z-complementary pairs with asymptotic ZCZ ratio of 3/4,

    A. R. Adhikary, S. Majhi, Z. Liu, and Y . L. Guan, “New sets of even-length binary Z-complementary pairs with asymptotic ZCZ ratio of 3/4,” IEEE Signal Process. Lett. , vol. 25, no. 7, pp. 970–973, Jul. 2018

    work page 2018

  43. [43]

    Constructions of even-period binary Z-complementary pairs with large ZCZs,

    C. Xie and Y . Sun, “Constructions of even-period binary Z-complementary pairs with large ZCZs,” IEEE Signal Process. Lett., vol. 25, no. 8, pp. 1141–1145, Aug. 2018

    work page 2018

  44. [44]

    ZCZ aperiodic complementary sequence sets with low column sequence PMEPR,

    Y . Li and C. Xu, “ZCZ aperiodic complementary sequence sets with low column sequence PMEPR,” IEEE Commun. Lett. , vol. 19, no. 8, pp. 1303–1306, Aug. 2015

    work page 2015

  45. [45]

    Large zero autocorrelation zones of Golay sequences and their applications,

    G. Gong, F. Huo, and Y . Yang, “Large zero autocorrelation zones of Golay sequences and their applications,” IEEE Trans. Commun., vol. 61, no. 9, pp. 3967–3979, Sep. 2013

    work page 2013

  46. [46]

    Optimal Z-complementary sequence sets with good peak-to-average power-ratio property,

    S. Wu and C. Chen, “Optimal Z-complementary sequence sets with good peak-to-average power-ratio property,” IEEE Signal Process. Lett., vol. 25, no. 10, pp. 1500–1504, Oct. 2018

    work page 2018

  47. [47]

    Optimal Z-complementary code set from generalized Reed-Muller codes,

    P. Sarkar, S. Majhi, and Z. Liu, “Optimal Z-complementary code set from generalized Reed-Muller codes,” IEEE Trans. Commun. , vol. 67, no. 3, pp. 1783–1796, Mar. 2019

    work page 2019

  48. [48]

    Inter-group complementary codes for interference-resistant CDMA wireless communica- tions,

    J. Li, A. Huang, M. Guizani, and H. Chen, “Inter-group complementary codes for interference-resistant CDMA wireless communica- tions,” IEEE Trans. Wireless Commun. , vol. 7, no. 1, pp. 166–174, Jan. 2008

    work page 2008

  49. [49]

    A direct construction of inter-group complementary code set,

    P. Sarkar, S. Majhi, H. Vettikalladi, and A. S. Mahajumi, “A direct construction of inter-group complementary code set,” IEEE Access, vol. 6, pp. 42 047–42 056, Aug. 2018

    work page 2018

  50. [50]

    A unified construction of perfect polyphase sequences,

    W. H. Mow, “A unified construction of perfect polyphase sequences,” in Proc. IEEE ISIT , Sep. 1995, pp. 459–

    work page 1995

  51. [51]

    Generalized Hadamard matrices,

    A. T. Butson, “Generalized Hadamard matrices,” in Proc. Am. Math. Soc. 13, 1962, pp. 894–898

    work page 1962

  52. [52]

    On orthogonal matrices,

    R. E. A. C. Paley, “On orthogonal matrices,” J. Math. Phys. 12 , pp. 311–320, 1933

    work page 1933

  53. [53]

    Complex Hadamard matrices - a catalogue (since 2006),

    W. Bruzda, W. Tadej, and K. ˙Zyczkowski, “Complex Hadamard matrices - a catalogue (since 2006),” 2006. [Online]. Available: http://chaos.if.uj.edu.pl/ karol/hadamard/index.php?q=catalogue

    work page 2006

  54. [54]

    Unreal BH (n, 6)’s and Hadamard matrices,

    B. Compton, R. Craigen, and W. de Launey, “Unreal BH (n, 6)’s and Hadamard matrices,” Preprint, 2008

    work page 2008

  55. [55]

    A note on the existence of BH (19, 6) matrices,

    F. Sz ¨oll˝osi, “A note on the existence of BH (19, 6) matrices,” Australian Jr. Combinatorics, vol. 55, pp. 31–34, 2013

    work page 2013

  56. [56]

    Fuglede’s conjecture is false in 5 and higher dimensions,

    T. Tao, “Fuglede’s conjecture is false in 5 and higher dimensions,” Math. Res. Lett. 11 , pp. 251–258, 2004

    work page 2004

  57. [57]

    Correlation and set size bounds of complementary sequences with low correlation zone,

    Z. Liu, Y . L. Guan, B. C. Ng, and H. Chen, “Correlation and set size bounds of complementary sequences with low correlation zone,” IEEE Trans. Commun. , vol. 59, no. 12, pp. 3285–3289, Dec. 2011

    work page 2011