The linearcomplexity of a sequence is an important parameter for many applications, especially those related to information security, and hardware implementation. It is desirable to develop a corresponding measure an...
详细信息
The linearcomplexity of a sequence is an important parameter for many applications, especially those related to information security, and hardware implementation. It is desirable to develop a corresponding measure and theory for multidimensional arrays that are consistent with those of sequences. In this paper we use Grobner bases to develop a theory for analyzing the multidimensional linear complexity of general periodic arrays. We also analyze arrays constructed using the method of composition and establish tight bounds for their multidimensional linear complexity.
暂无评论