WE1.R7.2

A New Construction of Optimal Symmetrical ZCCS

Rajen Kumar, Indian Institute of Technology Patna, India; Prashant Kumar Srivastava, Indian Institute of Technolog Patna, India; Sudhan Majhi, Indian Institute of Science, India

Session:
Combinatorics and Information Theory 1

Track:
21: Other topics

Location:
VIP

Presentation Time:
Wed, 10 Jul, 10:10 - 10:30

Session Chair:
Chaoping Xing, Shanghai Jiaotong University
Abstract
In this paper, we propose new constructions for two-dimensional (2D) perfect array, complete complementary code (CCC), multiple CCC 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.
Resources