Optimal biphase sequences with large linear complexity derived from sequences over Z/sub 4/

DOI10.1109/18.481790zbMath0851.94016OpenAlexW2142818558MaRDI QIDQ4880002

Mohammad Umar Siddiqi, Parampalli Udaya

Publication date: 29 July 1996

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

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

zbMATH Keywords

Galois ringslinear complexityCDMAautocorrelationWelch boundcrosscorrelationSidelnikov boundspread-spectrumbiphase sequences

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (8)

Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. ⋮ Generator polynomials of characteristic ideal of maximal periodic arrays over Galois rings. ⋮ Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\) ⋮ Generalized modified Gold sequences ⋮ New family of binary sequences of period \(4(2^n - 1\)) with low correlation ⋮ On the Correlation Distribution of Kerdock Sequences ⋮ Two New Families of Low-Correlation Interleaved QAM Sequences ⋮ Maximal Periodic Two-Dimensional Arrays Over Galois Rings

This page was built for publication: Optimal biphase sequences with large linear complexity derived from sequences over Z/sub 4/