A construction ofp-ary balanced sequence with largek-error linear complexity
Madathil Sethumadhavan, C. Yogha Lakxmie, C. Vijayagovindan · Journal of Discrete Mathematical Sciences and Cryptography · 2006
In this paper we derive a result on the k-error linear complexity of balanced p-ary sequences of period N=p n . Using this result, we also describe a construction of a sequence having large linear complexity. These results are of relevance in the construction of key sequences for stream ciphers.