环R=F_4+vF_4上线性码的Macwilliams恒等式

本文研究了环R=F4+v F4上线性码及重量分布.利用环R=F4+v F4到F2的一种Gray映射?,证明了环上R线性码C的Gray像?(C)的对偶码为?(C⊥).然后,利用域F2上线性码与对偶码的重量分布的关系及Gray映射性质,给出了该环上线性码与对偶码之间的各种重量分布的Macwilliams恒等式.     

环Fq+uFq+vFq上的循环码和量子码

本文研究了环R=F_q+uF_q+vF_q(u²=u,v²=v,uv=vu=0)上的循环码构造量子码的方法.利用环R上循环码的分解与生成多项式,给出了R上一个循环码可以构造量子码的一个充要条件.作为这类循环码的应用,得到了新的非二元量子码.     

环F_p+uF_p+vF_p+uvF_p上线性码的Gray像

定义了有限非链环R=F_p+uF_p+vF_p+uvF_p到F_p⁴的一个Gray映射.在证明了该映射是R4的一个Gray映射.在证明了该映射是Rⁿ到F_pn到F_p⁽⁴ⁿ⁾的等重等距映射的基础上进一步证明了环R上的线性码C的Gray像是距离不变码.特别地如果C是环F_2+uF_2+vF_2+uvF_2上的Lee恒距线性码,则Φ(C)为F_2上的Hamming恒距线性码.最后通过映射Ψ把F_p+uF_p上的线性码和R上的一类线性码对应起来.     

环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恒等式.     

环F2+uF2+vF2上自对偶码的两种构造方法

本文研究环R=F2+uF2+vF2上的自对偶码问题.利用Rn到F3n2的Gray映射及R上的自对偶码C的Gray像为F2上自对偶码,获得了R上任何偶长度的自对偶码存在性的结论.最后,给出了R上两种构造自对偶码的方法.     

环F_2+uF_2上线性码的二元像

在有限环R=F2+uF2与F2之间定义了一个新的Gray映射,给出了环F2+uF2上线性码C的二元像φ(C)的生成矩阵,证明了环F2+uF2上线性码C及其对偶码的二元像仍是对偶码.     

Z4上偶长度的LCD负循环码

线性互补对偶(LCD)码是一类重要的纠错码,在通信系统、数据存储以及密码等领域都有重要的应用.文章研究了整数模4的剩余类环Z₄上偶长度的LCD负循环码,给出了这类码的生成多项式,证明了这类码是自由可逆码;并且利用Z₄上偶长度负循环码构造了一类Lee距离至少为6的LCD码.     

环F_2+uF_2+u~2F_2上循环码的Gray距离

定义了环R=F2+uF2+u2 F2(u3=0)到F32的一个新的Gray映射.首先介绍环R上奇长度的循环码的挠码,给出了各阶挠码的生成多项式.利用一阶挠码与二阶挠码确立了R上奇长度的循环码的Gray距离.     

环R=IF_q+uIF_q(u~2=0)上线性码的深度分布及深度谱

本文通过推广环R′=F2+uF_2(u~2=0)上向量中的深度概念到环R=F_q+uF_q(u~2=0)上(q为素数的方幂),给出了R上码长为n的线性码的深度分布和深度谱,并由此绐出码字深度的一个递归算法.     

环F_p[v]/(v~m-v)上线性码的Gray映射及其应用

本文定义了环F_p[v]/(v~m-v)上线性码的Gray映射.该映射具有一般性,是某些特殊Gray映射的推广.利用这种一般的Gray映射,本文定义了环F_p[v]/(v~m-v)上线性码的Gray重量和Gray距离.另外给出了一类特殊的Gray映射,该映射具有保持自对偶性的性质.并在该类的某个映射下,构造了有限域F7上一个新的参数为[16,8,6]的自对偶码.     

Calibrations modulo v

The theory of calibrations is extended to show that certain surfaces are area-minimizing modulo v. For example, a complex algebraic variety in Cⁿ of degree d is area-minimizing modulo v for all v ⩾ 2d.     

The directed packing numbersDD(t,v, v), t≧4

A directed packing is a maximal collection ofk-subsets, called blocks, of a set of cardinalityv having the property that no orderedt-subset occurs in more than one block. A block contains an orderedt-set if its symbols appear, left to right, in the block. The cardinality of such a maximal collection is denoted byDD(t, k, v). We consider the special case whenk=v and derive some results on the sizes of maximal collections.     

Existence of (2, 8) GWhD( v) and (4, 8) GWhD( v) with $${ v \equi v 0,1 (mod 8)}$$

(2, 8) Generalized Whist tournament Designs (GWhD) on v players exist only if . We establish that these necessary conditions are sufficient for all but a relatively small number of (possibly) exceptional cases. For there are at most 12 possible exceptions: {177, 249, 305, 377, 385, 465, 473, 489, 497, 537, 553, 897}. For there are at most 98 possible exceptions the largest of which is v = 3696. The materials in this paper also enable us to obtain four previously unknown (4, 8)GWhD(8n+1), namely for n = 16,60,191,192 and to reduce the list of unknown (4, 8) GWhD(8n) to 124 values of v the largest of which is v = 3696.      

W v paths on the torus

We say that a cell complex has theW _v property provided any two vertices can be joined by a path that never returns to a facet once it leaves it. The boundaries of convex polytopes have been shown to have theW _v property for polytopes of dimensions at most 3. We extend the three-dimensional result to polyhedral maps on the torus by showing that all such maps have theW _v property. We also show that theW _v property for all polyhedral maps on manifolds of a given genus is equivalent to the property that for all maps on manifolds of that genus each two faces lie in a subcomplex that is a cell.     

W v cycles in plane graphs

A cycle in a plane graphG is called aW _v cycle if it has a connected (or empty) intersection with each face of the graph. We show that if the minimum degree (G)3 thenG has aW _v cycle and the lengthw(G) of a longestW _v cycle is bounded by the number,f(G), of faces ofG. The classW of graphsG withw(G)=f(G) is completely characterized by an characterized by an inductive construction from two graphs, namelyK ₄ and a face merging of two copies ofK ₄ on one hand, and in terms involving Halin graphs and face merging on the other hand. Longest cycles in members ofW are investigated. The shortness coefficient ofW is proved to be between one-half and three-quarters inclusively.     

Über die v. Haerdtlsche Bahn

Ohne Zusammenfassung