New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes
From MaRDI portal
Abstract: A new method to construct -ary complementary sequence sets (CSSs) and complete complementary codes (CCCs) of size is proposed by using desired para-unitary (PU) matrices. The concept of seed PU matrices is introduced and a systematic approach on how to compute the explicit forms of the functions in constructed CSSs and CCCs from the seed PU matrices is given. A general form of these functions only depends on a basis of the functions from to and representatives in the equivalent class of Butson-type Hadamard (BH) matrices. Especially, the realization of Golay pairs from the our general form exactly coincides with the standard Golay pairs. The realization of ternary complementary sequences of size is first reported here. For the realization of the quaternary complementary sequences of size 4, almost all the sequences derived here are never reported before. Generalized seed PU matrices and the recursive constructions of the desired PU matrices are also studied, and a large number of new constructions of CSSs and CCCs are given accordingly. From the perspective of this paper, all the known results of CSSs and CCCs with explicit GBF form in the literature (except non-standard Golay pairs) are constructed from the Walsh matrices of order 2. This suggests that the proposed method with the BH matrices of higher orders will yield a large number of new CSSs and CCCs with the exponentially increasing number of the sequences of low peak-to-mean envelope power ratio.
Recommendations
- New constructions of Z-complementary code sets and mutually orthogonal complementary sequence sets
- A new combinatorial approach to the construction of constant composition codes
- A New Construction for Constant-Composition Codes
- A Systematic Framework for the Construction of Optimal Complete Complementary Codes
- New construction methods of quaternary periodic complementary sequence sets
- Construction of new completely regular q-ary codes from perfect q-ary codes
- A Combinatorial Construction of Perfect Codes
- A New Construction Framework for Polyphase Complete Complementary Codes With Various Lengths
- On new completely regular q-ary codes
- New construction of \((p, d, r)\)-code from finite set \([n]\)
Cited in
(15)- New constructions of Z-complementary code sets and mutually orthogonal complementary sequence sets
- New complementary sets of length 2ᵐ and size 4
- New sets of non-orthogonal spreading sequences with low correlation and low PAPR using extended Boolean functions
- Status of three classes of sequences
- Two constructions of two-dimensional Golay complementary array sets with flexible sizes in two dimensions
- On binary linear codes and binary pseudo-random sequences
- A direct construction of 2D-CCC with arbitrary array size and flexible set size using multivariable function
- Constructions of non-binary Golay complementary pairs of new lengths
- Frequency distance sequences for packet detection in physical-layer security. In memory of Kai-Uwe Schmidt
- Constructions of Golay complementary (array) sets based on extended Boolean functions
- Uni/multi variate polynomial embeddings for zkSNARKs
- New spectrally null constrained mutually orthogonal complementary sets and Z-complementary code sets
- A unified construction of type-I even length Z-complementary pairs based on generalized Boolean function
- Constructions of two-dimensional complete complementary codes with flexible array sizes
- New construction methods of quaternary periodic complementary sequence sets
This page was built for publication: New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001838)
