Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$

DOI10.1109/TIT.2010.2103757zbMath1366.94446OpenAlexW2134693538MaRDI QIDQ5281037

Hong-Yeop Song, Zongduo Dai, Dingfeng Ye, Guang Gong

Publication date: 27 July 2017

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

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

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) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items (10)

Trace representation and linear complexity of binary sequences derived from Fermat quotients ⋮ On the \(\mathrm{GF}(p)\) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences ⋮ On the representation of fields as finite sums of proper subfields ⋮ On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\) ⋮ Trace representation of pseudorandom binary sequences derived from Euler quotients ⋮ Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\) ⋮ Characteristic digit-sum sequences ⋮ Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients ⋮ A trace representation of binary Jacobi sequences ⋮ Trace representation of Legendre sequences over non-binary fields

This page was built for publication: Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$