伪随机与 de Bruijn 阵列码
Pseduo-Random and de Bruijn Array Codes
AI总结:
本文将伪随机阵列与完美映射概念推广为码,利用折叠不可约多项式生成序列构造伪随机阵列码并分析最小距离,同时给出 de Bruijn 阵列码的直接与递归构造。
摘要:
伪随机阵列和完美映射分别是 M-序列与 de Bruijn 序列的二维对应物。我们修改这些定义,使其能够应用于码。这些码也是 de Bruijn 图中某些因子的二维对应物;这些因子在 de Bruijn 图中被称为零因子和完美因子。我们采用折叠技术构造伪随机阵列码,并考察所构造码的最小距离。该折叠作用于由不可约多项式,或由具有相同次数和相同指数的不可约多项式之积生成的序列。文中还提出并讨论了 de Bruijn 阵列码的直接构造和递归构造。
英文摘要:
Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain factors in the de Bruijn graph. These factors are called zero factors and perfect factors in the de Bruijn graph. We apply a folding technique to construct pseudo-random array codes and examine the minimum distance of the constructed codes. The folding is applied on sequences generated from irreducible polynomials or a product of irreducible polynomials with the same degree and the same exponent. Direct and recursive constructions for de Bruijn array codes are presented and discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。