Wu, Shing-Wei and Chen, Chao-Yu and Liu, Zilong (2021) How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths? IEEE Transactions on Information Theory, 67 (6). pp. 3464-3472. DOI https://doi.org/10.1109/tit.2020.2980818
Wu, Shing-Wei and Chen, Chao-Yu and Liu, Zilong (2021) How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths? IEEE Transactions on Information Theory, 67 (6). pp. 3464-3472. DOI https://doi.org/10.1109/tit.2020.2980818
Wu, Shing-Wei and Chen, Chao-Yu and Liu, Zilong (2021) How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths? IEEE Transactions on Information Theory, 67 (6). pp. 3464-3472. DOI https://doi.org/10.1109/tit.2020.2980818
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Golay complementary set (GCS); mutually orthogonal complementary set (MOCS); complete complementary code (CCC); generalized Boolean function |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 01 Jul 2021 15:28 |
| Last Modified: | 30 Oct 2024 16:02 |
| URI: | http://repository.essex.ac.uk/id/eprint/30464 |
Available files
Filename: How to construct mutually orthogonal complementary sequence sets.pdf