pn-周期二元多维序列2-adic联合复杂度快速算法

A fast algorithm for the 2-adic joint complexity of pn-periodic a binary multisequence

摘要: 本文提出了一个快速算法确定pn-周期二元FCSR多维序列2-adic联合复杂度，给出了该算法理论上的推导，产生了pn-周期二元多维序列2-adic联合复杂度一个上界，在确定的条件下，这个上界是好的.

Abstract: To determine the 2-adic joint complexity of pn-periodic binary multisequences generated by feedback shift registers with carry operation (FCSR), an algorithm was presented and its theoretical derivation was provided, which yields an upper bound for the 2-adic joint complexity of a pn-periodic binary multisequence. Under a fixed condition, this upper bound is good.