Linear Complexity over F p of Ternary Sidel’nikov Sequences

DOI10.1007/11863854_6zbMath1152.94389OpenAlexW17431867MaRDI QIDQ3541909

Jong-Seon No, Habong Chung, Jung-Soo Chung, Young Sik Kim

Publication date: 27 November 2008

Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11863854_6

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 (3)

Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ Linear complexity of ternary sequences formed on the basis of power residue classes

This page was built for publication: Linear Complexity over F p of Ternary Sidel’nikov Sequences