A multi-dimensional approach to the construction and enumeration of Golay complementary sequences
Journal of Combinatorial Theory Series A
New QAM golay complementary pairs with unequal sequence power
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Research on binary complementary sequence pair set and it's construction methods
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Novel sequence design for low-PMEPR and high-code-rate OFDM systems
IEEE Transactions on Communications
Construction of M-QAM sequences based on generalized Rudin-Shapiro polynomials
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
New 64-QAM Golay complementary sequences
IEEE Transactions on Information Theory
A construction of general QAM Golay complementary sequences
IEEE Transactions on Information Theory
A new construction of 16-QAM near complementary sequences
IEEE Transactions on Information Theory
Generalised complementary arrays
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Paraunitary generation/correlation of QAM complementary sequence pairs
Cryptography and Communications
| Hi-index | 755.02 |
We present a new construction of 16-QAM Golay sequences of length n = 2m. The number of constructed sequences is (14 + 12m)(m!/2)4m+1. When employed as a code in an orthogonal frequency-division multiplexing (OFDM) system; this set of sequences has a peak-to-mean envelope power ratio (PMEPR) of 3.6. By considering two specific subsets of these sequences, we obtain new codes with PMEPR bounds of 2.0 and 2.8 and respective code sizes of (2 + 2m)(m!/2)4m+1 and (4 + 4m)(m!/2)4m+1. These are larger than previously known codes for the same PMEPR bounds.