Extended codes and deep holes of MDS codes
Abstract
For a given linear code of length over and a nonzero vector in , Sun, Ding and Chen defined an extended linear code of , which is a generalisation of the classical extended code of and called the second kind of an extended code of (see arXiv:2307.04076 and arXiv:2307.08053). They developed some general theory of the extended codes and studied the extended codes of several families of linear codes, including cyclic codes, projective two-weight codes, nonbinary Hamming codes, and a family of reversible MDS cyclic codes. The objective of this paper is to investigate the extended codes of MDS codes over finite fields. The main result of this paper is that the extended code of an MDS code remains MDS if and only if the covering radius and the vector is a deep hole of the dual code . As applications of this main result, the extended codes of the GRS codes and extended GRS codes are investigated and the covering radii of several families of MDS codes are determined.
Cite
@article{arxiv.2312.05534,
title = {Extended codes and deep holes of MDS codes},
author = {Yansheng Wu and Cunsheng Ding and Tingfang Chen},
journal= {arXiv preprint arXiv:2312.05534},
year = {2023}
}
Comments
22 pages, submitted for possible publication