When are two geometric Goppa codes equal?
X. Chao-Ping · IEEE Transactions on Information Theory · 1992
Sufficient and necessary conditions are obtained for which the geometric Goppa codes C(D,G) and C(D,H) are equal for two divisors G and H. In particular, it is proven that if G and H are two effective divisors of the same degree smaller than n-1, then C(D,G) and C(D,H) are equal, if and only if G=H.>