一类代数几何码的构造

利用有限域Fq^8(s≥1为正整数，q为素数幂)上代数曲线构造了一类q元线性码，这类线性码是q^8元几何Goppa码的子域子码的子码，同时也是Chaoping Xing，SanLing构造的代数几何码[1]的推广。     

关于Goppa 几何码最小距离的一个新方法

引进一个关于Goppa几何码(代数几何码)最小距离界的一个新方法.应用Maharaj的思想(即用显示基来近似表达Riemann-Roch空间)到Goppa几何码的最小距离的界上去.通过厄米特曲线上的代数几何码的一类例子,来证明标准的几何码的下界在某些情形下可以被显著地改进.进一步地,我们给出了这些码的最小距离上界,并说明了我们的下界非常接近这个上界.     

代数函数域上的局部恢复码

假设C是有限域Fq上的[n,k]线性码,如果码字的每个坐标是其它至多r个坐标的函数,称C是(n,k,r)线性码,这里r是较小的数.本文在代数函数域上构造出了局部恢复码,它的码长不受字符集大小的限制,实际上,它的码长可以远远大于字符集的大小;并将此方法应用于广义Hermite函数域,得到了一类广义Hermite函数域上的...     

代数几何码的测试

性质测试是90年代开始由多种研究引发的,GF（q）^n中一个线性码C称为局部可测试的,当且仅当存在一个随机化算法,使得只要输入任一个GF（q）^n中向量的很少一部分坐标（一般而言是常数个坐标）,这个随机化算法就可以很高的概率判定此向量是否是C中码字．Blum,Luby和Rubinfeld由于和概率可验证证明的紧密关系研究了码的局部可测试性,然而怎样刻画局部可测试码是一个复杂且甚具挑战性的问题．对Reed—Solomon（RS）码、Reed．Muller（RM）码、循环码、BCH码的对偶码及代数几何码的迹子码,已经研究了局部可测试问题．在本文中我们给出了代数几何码的线性参数的测试子,并证明了在一个不太强的限制条件下代数几何码不是局部可测试的．     

基于代数几何码的密钥共享系统

本文根据代数几何码的特点,设计了一个(k,m,n)密钥共享系统,使这个系统既具有共享系统的特点又具有纠错能力.同时,我们还说明了本文给出的系统是McEliece提出的RS码共享系统的推广。     

一类具有双恢复集的局部恢复码的构造

假设C是有限域Fq上的[n,κ]线性码,如果码字的每个坐标是其它至多r个坐标的函数,称C是(n,k,r)局部恢复码,这里r是较小的数.在分布式存储系统中,具有多个恢复集的局部恢复码使得数据在系统中更具实际意义,因为它可以避免热数据的频繁访问.引入代数函数域、特别是Hermite函数域去构造局部恢复码,这类局部恢复码具有...     

具有优良渐近参数的代数几何码

本文讨论了一类具有好的渐近参数的代数几何码.通过对除子类数、高次有理除子数以及代数几何码的参数分析,得到一类码其渐近界优于Gilbert-Varshamov界和Xing界.在这两个界的交点处,渐近界有所改进.     

平面曲线上几何MDS码的主猜想

本文用Ｌａｎｇ－Ｗｅｉｌ的一个经典结果证明了在一定维数限制下充分大域上平面代数曲线上ＭＤＳ码的主猜想成立。     

渐近参数优于 Gilbert-Varshamov 和 Xing 界的非线性码

证明了Gilbert-Varshamov 和 Xing界在它们的交点附近,可以被有限域代数曲线上的非线性码所显著改进.     

代数函数域的一些Artin-Schreier型扩张相伴的Riemann-Roch空间

阐明给定代数函数域上一些除子的Riemann-Roch空间是代数几何码构造的基础.给出代数函数域的一些Artin-Schreier型扩张的Riemann-Roch空间的一组基,并应用于编码理论,得到F_(16)上参数分别是[54,43,5],[54,41,7],[54,40,8]的代数几何码.     

Asymptotically Good Codes from Generalized Algebraic-Geometry Codes

We consider generalized algebraic-geometry codes, based on places of the same degree of a fixed algebraic function field over a finite field. In this note, using a method similar to the Justesen’s one, we construct a family of such codes which is asymptotically good.Communicated by: D. Jangnickel     

Automorphisms of hyperelliptic GAG-codes

We determine the n-automorphism group of generalized algebraic-geometry codes associated with rational, elliptic and hyperelliptic function fields. Such group is, up to isomorphism, a subgroup of the automorphism group of the underlying function field.     

A New Approach to the Main Conjecture on Algebraic-Geometric MDS Codes

The Main Conjecture on MDS Codes statesthat for every linear [n, k] MDS code over q, if 1 <k < q, then n q+1,except when q is even and k=3 or k=q-1,in which cases n q +2. Recently, there has beenan attempt to prove the conjecture in the case of algebraic-geometriccodes. The method until now has been to reduce the conjectureto a statement about the arithmetic of the jacobian of the curve,and the conjecture has been successfully proven in this way forelliptic and hyperelliptic curves. We present a new approachto the problem, which depends on the geometry of the curve afteran appropriate embedding. Using algebraic-geometric methods,we then prove the conjecture through this approach in the caseof elliptic curves. In the process, we prove a new result aboutthe maximum number of points in an arc which lies on an ellipticcurve.     

Improvements on Generalized Hamming Weights of Some Trace Codes

We obtain improved bounds for the generalized Hamming weights of some trace codes which include a large class of cyclic codes over any finite field. In particular, we improve the corresponding bounds of Stichtenoth and Voss [8] using various methods altogether.     

Curves in Projective Spaces and Almost MDS Codes

A k-track in PG(n,q) is a set of k points such that every n of them are in general position. Here, we construct a class of n-tracks arising from algebraic curves.     

Curves with Many Points and Multiplication Complexity in Any Extension of q

From the existence of algebraic function fields having some good properties, we obtain some new upper bounds on the bilinear complexity of multiplication in all extensions of the finite field _q, where q is an arbitrary prime power. So we prove that the bilinear complexity of multiplication in the finite fields _qⁿ is linear uniformly in q with respect to the degree n.     

Nakajimaʼs remark on Hennʼs proof

We fill up a gap in Hennʼs proof concerning large automorphism groups of function fields of degree 1 over an algebraically closed field of positive characteristic.