Construction of optimal binary Z-complementary code sets with new lengths using generalized Boolean function

DOI10.1007/s12095-023-00658-yOpenAlexW4384299396MaRDI QIDQ6086197

Gobinda Ghosh, Sudhan Majhi, Subhabrata Paul

Publication date: 9 November 2023

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-023-00658-y

zbMATH Keywords

aperiodic correlationgeneralized Boolean functioncomplete complementary codeZ-complementary code set

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10)

Cites Work

• New constructions of Z-complementary code sets and mutually orthogonal complementary sequence sets
• Complete Mutually Orthogonal Golay Complementary Sets From Reed–Muller Codes
• Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
• New Optimal $Z$-Complementary Code Sets Based on Generalized Paraunitary Matrices

This page was built for publication: Construction of optimal binary Z-complementary code sets with new lengths using generalized Boolean function