一类后缀码的代数性质

利用自由含幺半群X*上的一个偏序关系,介绍了一类特殊的后缀码.通过定义这类后缀码上的两种二元运算,研究了这类后缀码的代数性质.证明了该子类在这两种运算下形成一个加法导出是半格的半环,并且满足吸收律.从而提供了一个满足吸收律的半格序半群的例子.     

Fast decoding of quasi-perfect Lee distance codes

A code D over Z ² _n is called a quasi-perfect Lee distance-(2t + 1) code if d _L(V,W) ≥ 2t + 1 for every two code words V,W in D, and every word in Z ² _n is at distance ≤ t + 1 from at least one code word, where D _L(V,W) is the Lee distance of V and W. In this paper we present a fast decoding algorithm for quasi-perfect Lee codes. The basic idea of the algorithm comes from a geometric representation of D in the 2-dimensional plane. It turns out that to decode a word it suffices to calculate its distance to at most four code words.     

On the integrality of nth roots of generating functions

Motivated by the discovery that the eighth root of the theta series of the E₈ lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f∈R (where R=1+xZ?x?) can be written as f=gn for g∈R, n?2. Let Pn:={gn|g∈R} and let . We show among other things that (i) for f∈R, f∈Pn⇔f (mod μn)∈Pn, and (ii) if f∈Pn, there is a unique g∈Pn with coefficients mod μn/n such that f≡gn (mod μn). In particular, if f≡1 (mod μn) then f∈Pn. The latter assertion implies that the theta series of any extremal even unimodular lattice in Rn (e.g. E₈ in R⁸) is in Pn if n is of the form i²j³k⁵ (i?3). There do not seem to be any exact analogues for codes, although we show that the weight enumerator of the rth order Reed-Muller code of length m² is in Pr² (and similarly that the theta series of the Barnes-Wall lattice BWm² is in Pm²). We give a number of other results and conjectures, and establish a conjecture of Paul D. Hanna that there is a unique element f∈Pn (n?2) with coefficients restricted to the set {1,2,…,n}.     

Recursive error correction for general Reed-Muller codes

Reed-Muller (RM) codes of growing length n and distance d are considered over a binary symmetric channel. A recursive decoding algorithm is designed that has complexity of order nlogn and corrects most error patterns of weight (dlnd)/2. The presented algorithm outperforms other algorithms with nonexponential decoding complexity, which are known for RM codes. We evaluate code performance using a new probabilistic technique that disintegrates decoding into a sequence of recursive steps. This allows us to define the most error-prone information symbols and find the highest transition error probability p, which yields a vanishing output error probability on long codes.     

利用有限域上一类幂零阵的标准形构造Cartesian认证码

Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.     

分圆域中的线性分组码

为实现面向多维信号有限域上的编码,本文从素元出发,利用素元生成的理想为素理想,研究对任意正整数n,分圆域Q(e2πi/n)的代数整数环模素理想所得的剩余域.当错误取值于有限域乘群的一个循环子群时,这种方法得到的有限域上面向 (n)维信号的线性分组码可以纠单个错,从而为码调制提供了一种代数渐进方法,推广了文[3-5]中的结果.     

环F_2+uF_2+u~2F_2上线性码的MacWilliams恒等式

记R=F_2+uF_2+u~2F_2,定义了环R上码字的李重量分布的概念,构造了从R~n到F_2~(3n)的Gray映射φ.通过对环R上线性码及其对偶码生成矩阵的研究,证明了环R上线性码及其对偶码的Gray象是F_2上的对偶码.利用域F_2上线性码及其对偶码的重量分布关系,得到了环R上线性码及其对偶码关于李重量分布的MacWilliams恒等式.     

The polynomial degree of the Grassmannian G(1,n,q) of lines in finite projective space PG(n, q)

Let G: = G(1,n,q) denote the Grassmannian of lines in PG(n,q), embedded as a point-set in PG(N, q) with For n = 2 or 3 the characteristic function of the complement of G is contained in the linear code generated by characteristic functions of complements of n-flats in PG(N, q). In this paper we prove this to be true for all cases (n, q) with q = 2 and we conjecture this to be true for all remaining cases (n, q). We show that the exact polynomial degree of is for δ: = δ(n, q) = 0 or 1, and that the possibility δ = 1 is ruled out if the above conjecture is true. The result deg( for the binary cases (n,2) can be used to construct quantum codes by intersecting G with subspaces of dimension at least      

Chinese remainder codes

Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n for the information bit, embed R/J _i into R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n, and assign the cosets of R/J _i as the subring of R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n and the cosets of R/J _i in R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n as check lines. Many code classes exist in the Chinese remainder codes that have high code rates. Chinese remainder codes are the essential generalization of Sun Zi codes. Selected from Journal of Mathematical Research and Exposition, 2004, 24(2): 347–352     

On the code generated by the incidence matrix of points and hyperplanes in <Emphasis Type=Italic>PG</Emphasis>(<Emphasis Type=Italic>n</Emphasis>,<Emphasis Type=Italic>q</Emphasis>) and its dual

In this paper, we study the p-ary linear code C(PG(n,q)), q = p ^h , p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n,q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n,q) and we exclude all possible codewords arising from small linear blocking sets. We also look at the dual code of C(PG(n,q)) and we prove that finding the minimum weight of the dual code can be reduced to finding the minimum weight of the dual code of points and lines in PG(2,q). We present an improved upper bound on this minimum weight and we show that we can drop the divisibility condition on the weight of the codewords in Sachar’s lower bound (Geom Dedicata 8:407–415, 1979). G. Van de Voorde’s research was supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen).