On the linear complexity of some new \(q\)-ary sequences

DOI10.1016/j.ins.2008.01.015zbMath1234.94020OpenAlexW1975608191MaRDI QIDQ942314

B. E. Eshmatov

Publication date: 5 September 2008

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2008.01.015

zbMATH Keywords

linear complexitytrace functionstream cipher\(q\)-ary sequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (1)

Studies on the distribution of the shortest linear recurring sequences

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Sequences related to Legendre/Jacobi sequences
• Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
• Optimum OVSF code reassignment in wideband CDMA forward radio link
• GMW sequences (Corresp.)
• A Simple Unpredictable Pseudo-Random Number Generator
• Relationships between m-sequences over GF(q) and GF(q/sup m/)
• Some New Difference Sets
• Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
• Crosscorrelation of m-sequences over nonprime finite fields
• p-ary unified sequences: p-ary extended d-form sequences with the ideal autocorrelation property
• New nonbinary sequences with ideal two-level autocorrelation
• Q-ary cascaded GMW sequences
• A new family of ternary sequences with ideal two-level autocorrelation function

This page was built for publication: On the linear complexity of some new \(q\)-ary sequences