Linear Complexity over F p of Ternary Sidel’nikov Sequences
From MaRDI portal
Publication:3541909
DOI10.1007/11863854_6zbMath1152.94389MaRDI QIDQ3541909
Young Sik Kim, Jong-Seon No, Habong Chung, Jung-Soo Chung
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
68Q25: Analysis of algorithms and problem complexity
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
Related Items
Linear complexity of ternary sequences formed on the basis of power residue classes, Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences