Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 18 min ago
PreprintCC BY 4.0arXiv

Construction of New Complete Complementary Codes Using Extended Boolean Functions and Permutations

  • Aditya Prakash
  • Rajen Kumar
Open at sourcePDFDOICite

Abstract

Complete complementary code (CCC) is a crucial component in the design and optimization of modern wireless communication systems, particularly in addressing challenges related to interference, spectral efficiency, and signal quality. The design of CCCs is an active area of research, as it directly impacts the number of users that can be supported interference-free in the system. In the literature, CCC constructions are restricted by a set size smaller than the sequence length. In this paper, we introduce a novel construction method for CCCs based on the extended Boolean functions (EBF) that overcome existing restrictions by including a set size bigger than the sequence length. Further, the proposed construction uses functions which are new in literature and provide us with new CCCs. This is also the very first construction where row PMEPR is also bounded by n for a set size in the form of power of n.

Related

  1. Shift-Invariant Permutations with Polynomial Composition: Construction and Algebraic Structure
    Cheng Lyu, Dabin Zheng, Mu Yuan +1
    arXivPreprintCC BY-NC-SA 4.0Full textGeneral mathematicsarXiv
  2. Constructions of complete permutations over 𝔽qn
    Sartaj Ul Hasan, Ramandeep Kaur, Hridesh Kumar +2
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. Explicit construction of optimal binary linear complementary pairs via Belov codes
    Yansheng Wu, Jing Chen, Jong Yoon Hyun
    arXivPreprintCC BY-NC-SA 4.0Full textGeneral mathematicsarXiv
  4. Nonnegativity Shapes Predictive Uncertainty: Complementary Model Fits and Quantile Construction
    Jialin Li
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Counting Hamiltonian Sturm permutations: generating functions and Gaussian distributions
    Bernold Fiedler, Carlos Rocha
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{prakash2026construction,
  title = {{Construction of New Complete Complementary Codes Using Extended Boolean Functions and Permutations}},
  author = {Aditya Prakash and Rajen Kumar},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.04796},
  eprint = {2611.04796},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.04796},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Construction of New Complete Complementary Codes Using Extended Boolean Functions and Permutations
AU  - Aditya Prakash
AU  - Rajen Kumar
PY  - 2026
DA  - 2026/11/03
PB  - arXiv
DO  - 10.48550/arxiv.2611.04796
UR  - https://arxiv.org/abs/2611.04796
AB  - Complete complementary code (CCC) is a crucial component in the design and optimization of modern wireless communication systems, particularly in addressing challenges related to interference, spectral efficiency, and signal quality. The design of CCCs is an active area of research, as it directly impacts the number of users that can be supported interference-free in the system. In the literature, CCC constructions are restricted by a set size smaller than the sequence length. In this paper, we introduce a novel construction method for CCCs based on the extended Boolean functions (EBF) that overcome existing restrictions by including a set size bigger than the sequence length. Further, the proposed construction uses functions which are new in literature and provide us with new CCCs. This is also the very first construction where row PMEPR is also bounded by n for a set size in the form of power of n.
ER  -