How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths?

DOI10.1109/TIT.2020.2980818MaRDI QIDQ5001732zbMATH OpenOpenAlexFDO

Authors Shing-Wei Wu, Chao-Yu Chen, Zi-Long Liu

Publication date 23 July 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2003.06991

zbMATH Keywords

constructiongeneralized Boolean functions (GBFs)mutually orthogonal complementary sets (MOCSs)

Mathematics Subject Classification ID

Source coding (94A29) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Abstract: Mutually orthogonal complementary sets (MOCSs) have received significant research attention in recent years due to their wide applications in communications and radar. Existing MOCSs which are constructed based on generalized Boolean functions (GBFs) mostly have lengths of power-of-two. How to construct MOCSs with non-power-of-two lengths whilst having large set sizes is a largely open problem. With the aid of GBFs, in this paper, we present new constructions of such MOCSs and show that the maximal achievable set size is $1/2$ of the flock size of an MOCS.

Cited in

(4)

• New constructions of Z-complementary code sets and mutually orthogonal complementary sequence sets
• Lower bounds on the maximum cross-correlations of 2-D quasi-complementary array sets
• Two constructions for optimal Z-complementary sequence sets
• Constructions of Golay complementary (array) sets based on extended Boolean functions

This page was built for publication: How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001732)