Compressing mappings on primitive sequences over \(\mathbb Z/(2^e)\) and its Galois extension

DOI10.1006/FFTA.2002.0365zbMath1032.11057OpenAlexW2067036780MaRDI QIDQ1867470

Wen-Feng Qi, Xuan-Yong Zhu

Publication date: 2 April 2003

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.2002.0365

zbMATH Keywords

Galois ringprimitive polynomialcompressing mappinglinear sequence

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Polynomials over finite fields (11T06) Sequences (mod (m)) (11B50)

Related Items (9)

On the distinctness of modular reductions of primitive sequences over \(\mathbb Z/(2^{32}-1)\) ⋮ Injective maps on primitive sequences over \(\mathbb Z/(p^e)\) ⋮ On the distinctness of modular reductions of maximal length sequences modulo odd prime powers ⋮ A new result on the distinctness of primitive sequences over \(\mathbb Z/(pq)\) modulo 2 ⋮ Восстановление линейной рекурренты над примарным кольцом вычетов по ее усложнению ⋮ Восстановление линейной рекурренты над примарным кольцом вычетов по ее усложнению. II ⋮ On the distinctness of maximal length sequences over \(\mathbb Z/(pq)\) modulo 2 ⋮ Uniqueness of the distribution of zeroes of primitive level sequences over \(\mathbb Z/(p^e)\) ⋮ The nonlinear complexity of level sequences over \(\mathbb Z/(4)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Binary sequences derived from ML-sequences over rings. I: Periods and minimal polynomials
• Construction of noise-resistant codes by means of linear recurrences over Galois rings
• The first coordinate sequence of a linear recurrence of maximal period over a Galois ring
• A solution of the Harer-Zagier equation

This page was built for publication: Compressing mappings on primitive sequences over \(\mathbb Z/(2^e)\) and its Galois extension