A new lower bound on the dimensions of Goppa codes bas been given by Feng Guiliang (1983). In this paper, at first, a formula for computing the lower bound in some cases is offered, and a upper bound on the dimensions of Goppa codes and a method of finding the upper bound are given. In some special cases, the dimensions of Goppa codes can be obtained by using the upper bound and the lower bound.
V. D. Goppa, Probl. Peredach. Inform., 6(1970)3, 24-30.[2]E.R.BerIekamp, IEEE Trans. on IT, IT-19(1973)9, 590-592.[3]F.J.Macwillians, N.J.A. Sloane, Theory of Error-Correcting Codes, New York, North-Holland, (1977).[4]冯贵良,电子学报,1983年,第2期,第66-72页.[5]K.K.Tzeng,E.Iimmermann, IEEE.Trans. on IT, IT-21(1975)11, 712-716.[6]岳殿武,循环陪集结构及其应用,系统科学与数学,待发表.
DownLoad: