一类基于m-序列的正形置换的构造与计数

正形置换在密码学中有着广泛的应用,利用m-序列的"三项式特性",给出了一个构造n元正形置换的新方法,该方法既不同于已有的由n-2元构造n元正形置换,也不同于基于正交拉丁方的由n元构造n+1元正形置换的方法.     

Error Correcting Sequence and Projective De Bruijn Graph

Let X be a finite set of q elements, and n, K, d be integers. A subset C ⊂ X ⁿ is an (n, K, d) error-correcting code, if #(C) = K and its minimum distance is d. We define an (n, K, d) error-correcting sequence over X as a periodic sequence {a _i } _i=0,1,... (a _i ∈ X) with period K, such that the set of all consecutive n-tuples of this sequence form an (n, K, d) error-correcting code over X. Under a moderate conjecture on the existence of some type of primitive polynomials, we prove that there is a error correcting sequence, such that its code-set is the q-ary Hamming code with 0 removed, for q > 2 being a prime power. For the case q = 2, under a similar conjecture, we prove that there is a error-correcting sequence, such that its code-set supplemented with 0 is the subset of the binary Hamming code [2 ^m  − 1, 2 ^m  − 1 − m, 3] obtained by requiring one specified coordinate being 0. Received: October 27, 2005. Final Version received: December 31, 2007     

Multiplicative Difference Sets via Additive Characters

We use Fourier analysis on the additive group of to give an alternative proof of the recent theorem of Maschietti and to prove recent conjectures of No, Chung and Yun and No, Golomb, Gong, Lee and Gaal on difference sets in the multiplicative group of , m odd. Along the ay e prove a stronger form of a celebrated theorem of Welch on the 3-valued cross-correlation of maximal length sequences.     

关于Buchsbaum环的注记

本文证明了下述结论，设Ａ是一个级数为ｄ的Ｂｕｃｈｓｂａｕｍ环，（ａ₁，ａ₂，…，ａ_n）是Ａ的一个参数系统，则任何正整数ｎ，Ａ／（ａ₁，ａ₂，…，ａ_k）ⁿ（１≤ｋ≤ｄ）仍是ｄ－ｋ维的Ｂｕｃｈｓｂａｕｍ环．