𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3

DOI10.1515/JMC.2009.012zbMath1185.94041OpenAlexW2041127709MaRDI QIDQ3400065

Arne Winterhof, Nina Brandstätter

Publication date: 5 February 2010

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc.2009.012

zbMATH Keywords

character sumslinear complexitySidelnikov sequencesbinomial coefficients modulo \(p\)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Other character sums and Gauss sums (11T24) Cyclotomy (11T22)

Related Items (4)

On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ Addendum to Sidel'nikov sequences over nonprime fields ⋮ Additive character sums of polynomial quotients

Cites Work

• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
• A class of balanced binary sequences with optimal autocorrelation properties
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/

This page was built for publication: 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3