循环陪集首集与Goppa码、Alternant码最小距离下限

The Lead Set of Cyclotomic Cosets and the Lower Bounds of Minimum Distance for Goppa Codes and Alternant Codes

文献［１］将求Ｇｏｐｐａ码、Ａｌｔｅｒｎａｎｔ码最小距离下限归结为求循环陪集首集Ａ中最小的比ｒ大的元Ｍ（ｒ）的问题。本文研究了Ａ中元所具有的特征，并得到了计算Ｍ（ｒ）的一个有用的方法。

In paper[1],The problem of finding the lower bounds on minimum distance for Goppa Codes and Alternant Codes was turned into the problem of finding the element M(r) which is first greater than the given r in the lead set of cyclotomic cosets A.In this paper,we discuss the characteristic property of element in A and obtained a method of computing M(r).