A Direct Construction of Complete Complementary Code with Zero Correlation Zone property for Prime-Power Length
Nishant Kumar, Sudhan Majhi, and A.K. Upadhyay

TL;DR
This paper introduces a novel direct construction method for complete complementary-ZCZ (CC-ZCZ) code sets with prime-power lengths, combining properties of CCC and ZCZ sequences, and establishes their optimality and relationship with Reed-Muller codes.
Contribution
It presents a new direct construction of CC-ZCZ codes with prime-power lengths, including Golay-ZCZ codes, and explores their optimality, relationships, and properties.
Findings
Constructed CC-ZCZ codes with prime-power lengths.
Proved optimality of Golay-ZCZ codes using Tang-Fan-Matsufuzi bound.
Established relationship between CC-ZCZ codes and Reed-Muller codes.
Abstract
In this paper, we propose a direct construction of a novel type of code set, which has combined properties of complete complementary code (CCC) and zero-correlation zone (ZCZ) sequences and called it complete complementary-ZCZ (CC-ZCZ) code set. The code set is constructed by using multivariable functions. The proposed construction also provides Golay-ZCZ codes with new lengths, i.e., prime-power lengths. The proposed Golay-ZCZ codes are optimal and asymptotically optimal for binary and non-binary cases, respectively, by \emph{Tang-Fan-Matsufuzi} bound. Furthermore, the proposed direct construction provides novel ZCZ sequences of length , where is an integer . We establish a relationship between the proposed CC-ZCZ code set and the first-order generalized Reed-Muller (GRM) code, and proved that both have the same Hamming distance. We also counted the number of CC-ZCZ…
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
TopicsCoding theory and cryptography · Advanced Wireless Communication Techniques · Wireless Communication Networks Research
