On the automorphism groups of some AG-codes based on curves
arXiv:1305.3937
Abstract
We study curves and their applications to coding theory. Recently, Joyner and Ksir have suggested a decoding algorithm based on the automorphisms of the code. We show how curves can be used to construct MDS codes and focus on some curves with extra automorphisms, namely . The automorphism groups of such codes are determined in most characteristics.
A recent update of an old paper from 2006. Some connections to superelliptic curves are explored and references updated