Complexity measures for keystream multisequences over Z/（N） play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error joint N-adic complexity of periodic multisequences over Z/（N）, and establishes the existence of periodic N-adic multisequences over Z/（N） which simultaneously possess maximal joint N-adic complexity and large k-error joint N-adic complexity. Under some conditions the overwhelming majority of all T-periodic N-adic multi... 

【文章來源】：Journal of Systems Science & Complexity. 2014,27(02)EISCICSCD

【文章頁數(shù)】：12 頁


本文編號：3605233