English
Related papers

Related papers: Construction of Complete Complementary Codes over …

200 papers

This research focuses on constructing $q$-ary functions for complete complementary codes (CCCs) with flexible parameters. Most existing work has primarily identified sufficient conditions for $q$-ary functions related to $q$-ary CCCs. To…

Combinatorics · Mathematics 2024-09-24 Palash Sarkar , Chunlei Li , Sudhan Majhi , Zilong Liu

Complete complementary codes (CCCs) are highly valuable in the fields of information security, radar and communication. The spectrally null constrained (SNC) problem arises in radar and modern communication systems due to the reservation or…

Information Theory · Computer Science 2025-08-27 Rajen Kumar , Palash Sarkar , Prashant Kumar Srivastava , Sudhan Majhi

In recent years, complementary sequence sets have found many important applications in multi-carrier code-division multiple-access (MC-CDMA) systems for their good correlation properties. In this paper, we propose a construction, which can…

Information Theory · Computer Science 2021-05-24 Zhengchun Zhou , Fangrui Liu , Avik Ranjan Adhikary , Pingzhi Fan

Due to the zero nontrivial aperiodic correlation of complete complementary code (CCCs), it is used in asynchronous multi carrier code division multiple access (MC-CDMA) communication to provide zero interference performance. However, there…

Information Theory · Computer Science 2021-05-24 Bingsheng Shen , Yang Yang , Zhengchun Zhou

A new method to construct $q$-ary complementary sequence (or array) sets (CSSs) and complete complementary codes (CCCs) of size $N$ is introduced in this paper. An algorithm on how to compute the explicit form of the functions in…

Information Theory · Computer Science 2020-05-13 Zilong Wang , Dongxu Ma , Guang Gong

The rapid progression in wireless communication technologies, especially in multicarrier code-division multiple access (MC-CDMA), there is a need of advanced code construction methods. Traditional approaches, mainly based on generalized…

Information Theory · Computer Science 2024-09-13 Gobinda Ghosh , Sachin Pathak

The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for…

Information Theory · Computer Science 2010-03-16 Chenggao Han , Naoki Suehiro , Takeshi Hashimoto

Golay complementary pairs (GCPs) and complete complementary codes (CCCs) have found a wide range of practical applications in coding, signal processing and wireless communication due to their ideal correlation properties. In fact, binary…

Information Theory · Computer Science 2022-04-08 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

Recently, two-dimensional (2D) array codes have been found to have applications in wireless communication.In this paper, we propose direct construction of 2D complete complementary codes (2D-CCCs) with arbitrary array size and flexible set…

Information Theory · Computer Science 2024-09-12 Gobinda Ghosh , Sachin Pathak

Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new…

Information Theory · Computer Science 2023-02-23 Gobinda Ghosh , Sudhan Majhi , Shubabrata Paul

We propose new constructions for a two-dimensional ($2$D) perfect array, complete complementary code (CCC), and multiple CCCs as an optimal symmetrical $Z$-complementary code set (ZCCS). We propose a method to generate a two-dimensional…

Information Theory · Computer Science 2024-08-27 Rajen Kumar , Prashant Kumar Srivastava , Sudhan Majhi

A new method to construct $q$-ary complementary sequence sets (CSSs) and complete complementary codes (CCCs) of size $N$ is proposed by using desired para-unitary (PU) matrices. The concept of seed PU matrices is introduced and a systematic…

Information Theory · Computer Science 2020-01-15 Zilong Wang , Dongxu Ma , Guang Gong , Erzhong Xue

Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…

Information Theory · Computer Science 2020-10-22 Avik Ranjan Adhikary , Yanghe Feng , Zhengchun Zhou , Pingzhi Fan

This paper presents an efficient construction of two-dimensional (2D) complete complementary codes (CCCs) for their modern application as omnidirectional precoding matrices in massive MIMO systems to attain enhanced cell coverage. Unlike…

Information Theory · Computer Science 2022-05-10 Cheng-Yu Pai , Zilong Liu , You-Qi Zhao , Zhen-Ming Huang , Chao-Yu Chen

For a type-I $(K,M,Z,N)$-ZCCS, it follows $K \leq M \left\lfloor \frac{N}{Z}\right\rfloor$. In this paper, we propose a construction of type-II $(p^{k+n},p^k,p^{n+r}-p^r+1,p^{n+r})$-$Z$ complementary code set (ZCCS) using an extended…

Information Theory · Computer Science 2024-05-15 Rajen Kumar , Prashant Kumar Srivastava , Sudhan Majhi

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…

Information Theory · Computer Science 2022-07-28 Nishant Kumar , Sudhan Majhi , A. K. Upadhyay

Z-complementary code set (ZCCS), an extension of perfect complementary codes (CCs), refers to a set of two-dimensional matrices having zero correlation zone properties. ZCCS can be used in various multi-channel systems to support, for…

Information Theory · Computer Science 2019-11-11 Palash Sarkar , Sudhan Majhi , Zilong Liu

We consider perfect 1-error correcting codes over a finite field with $q$ elements (briefly $q$-ary 1-perfect codes). In this paper, a generalized concatenation construction for $q$-ary 1-perfect codes is presented that allows us to…

Discrete Mathematics · Computer Science 2017-11-02 Alexander M. Romanov

One of the important applications of Golay complementary sets (GCSs) is the reduction of peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM) systems. OFDM has played a major role in modern wireless…

Information Theory · Computer Science 2025-01-06 Abhishek Roy , Sudhan Majhi , Subhabrata Paul

This paper aims to construct optimal Z-complementary code set (ZCCS) with non-power-of-two (NPT) lengths to enable interference-free multicarrier code-division multiple access (MC-CDMA) systems. The existing ZCCSs with NPT lengths, which…

Information Theory · Computer Science 2021-04-21 Palash Sarkar , Sudhan Majhi , Zilong Liu
‹ Prev 1 2 3 10 Next ›