Contribution to Munuera's problem on the main conjecture of geometric hyperelliptic MDS codes

In coding theory, it is of great intererst to know the maximal length of MDS codes. In fact, the Main Conjecture says that the length of MDS codes over F-q is less than or equal to q+1 (except for some special cases). Munuera proposed a new way to attack the Main Conjecture on MDS codes for geometric codes. In particular, he proved the conjecture for codes arising from curves of genus one or two when the cardinal of the ground held is large enough. He also asked whether a similar theorem can be proved for any hyperelliptic curve. The purpose of this correspondence is to give an affirmative answer. In fact, our method also proves the Main Conjecture for geometric MDS codes for q = 2 if the genus of the hyperelliptic curve is either 1, 2 or 3, and for q = 3 if the genus of the curve is 1.