A New Construction of Optimal Symmetrical ZCCS
Rajen Kumar, Prashant Kumar Srivastava, Sudhan Majhi

TL;DR
This paper introduces new methods for constructing optimal symmetrical Z-complementary code sets (ZCCS) using two-dimensional arrays and mutually orthogonal sequences, enhancing code length and supporting multiple CCCs.
Contribution
It presents novel constructions for 2D perfect arrays, CCC, and multiple CCCs, with a method to extend code length without increasing set size, maintaining optimal correlation properties.
Findings
Developed a method to generate 2D perfect arrays and CCCs.
Extended CCC length using mutually orthogonal sequences.
Achieved multiple CCCs with correlation characteristics matching optimal symmetrical ZCCS.
Abstract
We propose new constructions for a two-dimensional (D) perfect array, complete complementary code (CCC), and multiple CCCs as an optimal symmetrical -complementary code set (ZCCS). We propose a method to generate a two-dimensional perfect array and CCC. By utilising mutually orthogonal sequences, we developed a method to extend the length of a CCC without affecting the set or code size. Additionally, this concept is extended to include the development of multiple CCCs, and the correlation characteristics of these multiple CCCs are identical with the characteristics of optimal symmetrical ZCCS.
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.
