Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences

DOI10.1109/TIT.2003.811924zbMath1063.94066MaRDI QIDQ4680119

Sang-Hyo Kim, Jong-Seon No, Tor Helleseth

Publication date: 1 June 2005

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

Mathematics Subject Classification ID

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

Related Items (12)

Trace representation and linear complexity of binary sequences derived from Fermat quotients ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences ⋮ Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\) ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ Addendum to Sidel'nikov sequences over nonprime fields ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences ⋮ On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d ⋮ On the linear complexity of bounded integer sequences over different moduli ⋮ Additive character sums of polynomial quotients

This page was built for publication: Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences