MacWilliams Extension Theorem for MDS codes over a vector space alphabet

摘要

The MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a monomial map. Unlike the linear codes, in general, nonlinear codes do not have the extension property. In our previous work, in the context of a vector space alphabet, the minimum code length, for which there exists an unextendable code isometry, was determined. In this paper an analogue of the extension theorem for MDS codes is proved. It is shown that for almost all, except 2-dimensional, linear MDS codes over a vector space alphabet the extension property holds. For the case of 2-dimensional MDS codes an improvement of our general result is presented. There are also observed extension properties of near-MDS codes. As an auxiliary result, a new bound on the minimum size of multi-fold partitions of a vector space is obtained.