Constructions of Spectrally Null Constrained Complete Complementary Codes via the Graph of Extended Boolean Functions

Complete complementary codes (CCCs) have important applications in communication, radar, and information security. In modern communication and radar systems, certain spectrum is reserved or prohibited from transmission, which leads to the so-called spectrally null constrained (SNC) problem. Compared...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on information theory Ročník 69; číslo 9; s. 6028 - 6039
Hlavní autori: Shen, Bingsheng, Yang, Yang, Zhou, Zhengchun, Mesnager, Sihem
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.09.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:0018-9448, 1557-9654
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Complete complementary codes (CCCs) have important applications in communication, radar, and information security. In modern communication and radar systems, certain spectrum is reserved or prohibited from transmission, which leads to the so-called spectrally null constrained (SNC) problem. Compared with vast works on conventional CCCs, relatively little is known about SNC-CCCs. One objective of this paper is to derive several constructions of CCCs with more flexible settings from the graph of extended Boolean functions. This generalizes earlier achievements on CCCs from recent literature. Another objective of this paper is to employ the graphs of extended Boolean functions and polynomial representation of sequences to construct SNC-CCCs.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2023.3280210