N-shift cross-orthogonal sequences
IEEE Transactions on Information Theory
Golay complementary array pairs
Designs, Codes and Cryptography
A multi-dimensional approach to the construction and enumeration of Golay complementary sequences
Journal of Combinatorial Theory Series A
From graph states to two-graph states
Designs, Codes and Cryptography
Generalised complementary arrays
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
IEEE Transactions on Information Theory
Generalized Reed-Muller codes and power control in OFDM modulation
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Lower bounds on the maximum cross correlation of signals (Corresp.)
IEEE Transactions on Information Theory
On cosets of the generalized first-order reed-muller code with low PMEPR
IEEE Transactions on Information Theory
Complementary Sets, Generalized Reed–Muller Codes, and Power Control for OFDM
IEEE Transactions on Information Theory
A Framework for the Construction ofGolay Sequences
IEEE Transactions on Information Theory
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Paraunitary generation/correlation of QAM complementary sequence pairs
Cryptography and Communications
| Hi-index | 0.00 |
We propose a construction for complementary sets of arrays that exploits a set of mutually-unbiased bases (a MUB). In particular we present, in detail, the construction for complementary pairs that is seeded by a MUB of dimension 2, where we enumerate the arrays and the corresponding set of complementary sequences obtained from the arrays by projection. We also sketch an algorithm to uniquely generate these sequences. The pairwise squared inner-product of members of the sequence set is shown to be 12$\frac {1}{2}$. Moreover, a subset of the set can be viewed as a codebook that asymptotically achieves 32$\sqrt {\frac {3}{2}}$ times the Welch bound.