关于 de Bruijn 阵列码 第二部分:线性码
On de Bruijn Array Codes Part II: Linear Codes
AI总结:
本文研究 M 序列的二维推广,提出伪随机阵列码的构造方法,并利用两种证明技术验证其性质,同时给出验证折叠序列是否产生伪随机阵列或阵列码的方法。
摘要:
由本原多项式生成的 M 序列具有许多有趣且理想的性质。伪随机阵列是 M 序列的二维推广。存在一些非本原多项式,其所有非零序列都具有相同的周期。这些多项式生成的序列集合具有与 M 序列相似的性质。本文给出了此类序列的二维推广。该推广针对伪随机阵列码,即一个由 $r_1 \ imes r_2$ 阵列组成的集合,其中每个 $n_1 \ imes n_2$ 非零矩阵恰好作为某个阵列中的一个窗口出现一次。此外,这些阵列具有移位相加性质,即两个阵列(或这些阵列的非平凡移位)的逐位相加得到的是该码中的另一个阵列(或另一个阵列的移位)。所有已知的阵列都可以通过折叠由不可约多项式或可约多项式(其因式具有相同的次数和相同的指数)生成的序列来形成。使用两种证明技术来证明这些构造确实是伪随机阵列码。第一种技术基于另一种不同于折叠的方法来构造其中一些阵列。第二种技术是对一种已知证明技术的推广。这种推广使得能够构造具有以前未知参数的伪随机阵列,并且还提供了第一种方法无法生成的各种伪随机阵列码。这两种技术还暗示了伪随机阵列码之间的两种不同层次结构。最后,将给出两种方法来验证由这些多项式生成的序列的折叠是否产生伪随机阵列或伪随机阵列码。
英文摘要:
An M-sequence generated by a primitive polynomial has many interesting and desirable properties. A pseudo-random array is the two-dimensional generalization of an M-sequence. There are non-primitive polynomials all of whose non-zero sequences have the same period. These polynomials generate \emph{sets} of sequences with properties similar to M-sequences. In this paper, a two-dimensional generalization for such sequences is given. This generalization is for a pseudo-random array code, which is a set of $r_1 \times r_2$ arrays in which each $n_1 \times n_2$ nonzero matrix is contained exactly once as a window in one of the arrays. Moreover, these arrays have the shift-and-add property, i.e., the bitwise addition of two arrays (or a nontrivial shift of such arrays) is another array (or a shift of another array) from the code. All the known arrays can be formed by folding sequences generated from an irreducible polynomial or a reducible polynomial whose factors have the same degree and the same exponent. Two proof techniques are used to prove the constructions are indeed of pseudo-random array codes. The first technique is based on another method, different from folding, for constructing some of these arrays. The second technique is a generalization of a known proof technique. This generalization enables the construction of pseudo-random arrays with parameters not known before, and also provides a variety of pseudo-random array codes which cannot be generated by the first method. The two techniques also suggest two different hierarchies between pseudo-random array codes. Finally, two methods to verify whether a folding of sequences, generated by these polynomials, yields a pseudo-random array or a pseudo-random array code, will be presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。