New complementary sets of length \(2^m\) and size 4
Publication:340175
DOI10.3934/amc.2016043zbMath1353.94028OpenAlexW2546826387MaRDI QIDQ340175
Gaofei Wu, Xue Feng Liu, Yu Qing Zhang
Publication date: 11 November 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2016043
Reed-Muller codesBoolean functionscomplementary setsGolay sequencesorthogonal frequency-division multiplexing (OFDM)peak-to-mean envelope power ratio (PMEPR)
Exact enumeration problems, generating functions (05A15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (1)
Cites Work
- A multi-dimensional approach to the construction and enumeration of Golay complementary sequences
- A complementary construction using mutually unbiased bases
- Paraunitary generation/correlation of QAM complementary sequence pairs
- On the PMEPR of Binary Golay Sequences of Length $2^{n}$
- Generalised Complementary Arrays
- On cosets of the generalized first-order reed-muller code with low PMEPR
- Complementary Sets, Generalized Reed–Muller Codes, and Power Control for OFDM
- A Framework for the Construction ofGolay Sequences
- Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
- Generalized Reed-Muller codes and power control in OFDM modulation
- Near-Complementary Sequences With Low PMEPR for Peak Power Control in Multicarrier Communications
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: New complementary sets of length \(2^m\) and size 4