A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)

DOI10.1109/TIT.2002.802609zbMath1062.94034MaRDI QIDQ4677595

Shimin Wei, Guozhen Xiao, Zong Chen

Publication date: 11 May 2005

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Polynomials over finite fields (11T06)

Related Items (4)

Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) ⋮ On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory ⋮ On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) ⋮ On the stability of periodic binary sequences with zone restriction

This page was built for publication: A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)