Linear Codes on Nonsingular Curves are Better than Those on Singular Curves
Ryutaroh Matsumoto · 1999
this paper, we show that for fixed designed minimum distance in a widerange, the dimension of codes on a singular curve is smaller than or equal to that of the codes on itsnormalization, and the number of check symbols of the former codes is larger than that of the latter codes. This implies the optimality of nonsingular curves for code construction.