The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings

DOI10.1007/978-3-540-85912-3_29zbMath1206.94043OpenAlexW1864879844MaRDI QIDQ3600453

Dmitrii Zinoviev, Patrick Solé

Publication date: 10 February 2009

Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85912-3_29

zbMATH Keywords

Galois ringsaperiodic autocorrelationPSLMSBpartial period distribution

Mathematics Subject Classification ID

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

Cites Work

• Binary sequences derived from ML-sequences over rings. I: Periods and minimal polynomials
• \(\mathbb Z_{8}\)-Kerdock codes and pseudorandom binary sequences
• Bounds on the growth rate on the peak sidelobe level of binary sequences
• An upper bound on the aperiodic autocorrelation function for a maximal-length sequence (Corresp.)
• Incomplete exponential sums over galois rings with applications to some binary sequences derived from Z/sub 2//sup l/
• The Most Significant Bit of Maximum-Length Sequences Over<tex>$BBZ_2^l$</tex>: Autocorrelation and Imbalance
• Low-Correlation, High-Nonlinearity Sequences for Multiple-Code CDMA
• On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences
• A Survey of the Merit Factor Problem for Binary Sequences

This page was built for publication: The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings