One-Error Linear Complexity over F p of Sidelnikov Sequences
From MaRDI portal
Publication:5450822
DOI10.1007/11423461_9zbMath1145.94415OpenAlexW49964822MaRDI QIDQ5450822
Hong-Yeop Song, Gohar M. Kyureghyan, Yu-Chang Eun
Publication date: 14 March 2008
Published in: Sequences and Their Applications - SETA 2004 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11423461_9
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (5)
On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ Addendum to Sidel'nikov sequences over nonprime fields ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ Additive character sums of polynomial quotients
This page was built for publication: One-Error Linear Complexity over F p of Sidelnikov Sequences
