Paraunitary-Based Boolean Generator for QAM Complementary Sequences of Length <inline-formula> <tex-math notation="LaTeX">2K </tex-math> </inline-formula>

DOI10.1109/TIT.2018.2839676MaRDI QIDQ4682886zbMATH OpenOpenAlexFDO

Authors S. Z. Budišin, P. Spasojević

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2018.2839676

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Paraunitary generation/correlation of QAM complementary sequence pairs
• Two constructions for 16-QAM complementary sequence sets with non-power-of-two length
• A Construction of General QAM Golay Complementary Sequences
• New Constructions of Complementary Sequence Pairs Over 4 ^q -QAM
• New Constructions of General QAM Golay Complementary Sequences
• Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
• Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
• Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates
• Termination Sequence Generation Circuits for Low-Density Parity-Check Convolutional Codes
• A simple construction of almost perfect quinary ASK and QAM sequences

Cited in

(1)

• Status of three classes of sequences

This page was built for publication: Paraunitary-Based Boolean Generator for QAM Complementary Sequences of Length <inline-formula> <tex-math notation="LaTeX">$2^{K}$ </tex-math> </inline-formula>

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682886)