Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period p

DOI10.1109/TIT.2010.2103757MaRDI QIDQ5281037zbMATH OpenOpenAlexFDO

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

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

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) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Trace representation and linear complexity of binary sequences derived from Fermat quotients
• Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\)
• The linear complexity of generalized cyclotomic binary sequences of period p^n
• Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
• Linear complexity of ternary sequences formed on the basis of power residue classes
• Linear complexity of generalized cyclotomic binary sequences of period \(pq\)
• Trace representation of binary sequences derived from Euler quotients
• On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two
• Trace representation of \(r\)-ary sequences derived from Euler quotients with prime-power modulus
• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus

Cited in

(13)

• A trace representation of binary Jacobi sequences
• Trace representation of pseudorandom binary sequences derived from Euler quotients
• Trace representation of Legendre sequences of Mersenne prime period
• On the representation of fields as finite sums of proper subfields
• scientific article; zbMATH DE number 1943094 (Why is no real title available?)
• On the \(\mathrm{GF}(p)\) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences
• Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
• On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
• On the representation of fields as sums of two proper subfields
• Characteristic digit-sum sequences
• Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\)
• Trace representation and linear complexity of binary sequences derived from Fermat quotients
• 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$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281037)