Extended codes and deep holes of MDS codes (2312.05534v1)
Abstract: For a given linear code $\C$ of length $n$ over $\gf(q)$ and a nonzero vector $\bu$ in $\gf(q)n$, Sun, Ding and Chen defined an extended linear code $\overline{\C}(\bu)$ of $\C$, which is a generalisation of the classical extended code $\overline{\C}(-\bone)$ of $\C$ and called the second kind of an extended code of $\C$ (see arXiv:2307.04076 and arXiv:2307.08053). They developed some general theory of the extended codes $\overline{\C}(\bu)$ and studied the extended codes $\overline{\C}(\bu)$ 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 $\overline{\C}(\bu)$ of MDS codes $\C$ over finite fields. The main result of this paper is that the extended code $\overline{\C}(\bu)$ of an MDS $[n,k]$ code $\C$ remains MDS if and only if the covering radius $\rho(\mathcal{C}{\bot})=k$ and the vector $\bu$ is a deep hole of the dual code $\C\perp$. 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.
- D. Bartoli, M. Giulietti, and I. Platoni, “On the covering radius of MDS codes,” IEEE Trans. Inf. Theory, vol. 61, no. 2, pp. 801-811, 2014.
- K. Kaipa, “Deep holes and MDS extensions of Reed–Solomon codes,” IEEE Trans. Inf. Theory, vol. 63, no. 8, pp. 4940-4948, 2017.
- I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields,” J. Soc. Ind. Appl. Math., vol. 8, no. 2, pp. 300-304, Jun. 1960.
- R. M. Roth and A. Lempel, “A construction of non-Reed-Solomon type MDS codes,” IEEE Trans. Inf. Theory, vol. 35, no. 3, pp. 655-657, May 1989.
- R. M. Roth and G. Seroussi, “On generator matrices of MDS codes (Corresp.),” IEEE Trans. Inf. Theory, vol. 31, no. 6, pp. 826-830, Nov. 1985.
- G. Seroussi, and R. M. Roth, “On MDS extensions of generalized Reed-Solomon codes,” IEEE Trans. Inf. Theory, vol. 32, no. 3, pp. 349-354, 1986.
- X. Shi, Q. Yue, and S. Yang, “New LCD MDS codes constructed from generalized Reed–Solomon codes,” J. Algebra Appl., vol. 18, no. 08, 1950150, 2019.
- Z. Sun and C. Ding, “The extended codes of a family of reversible MDS cyclic codes,” arXiv preprint arXiv:2307.04076, 2023.
- Z. Sun, C. Ding, and T. Chen, “The extended codes of some linear codes,” arXiv preprint arXiv:2307.08053, 2023.
- J. Zhang, D. Wan and K. Kaipa, “Deep holes of projective Reed-Solomon codes,” IEEE Trans. Inf. Theory, vol. 66, no. 4, pp. 2392-2401, 2020.
- J. Zhuang, Q. Cheng and J. Li, “On determining deep holes of generalized Reed–Solomon codes,” IEEE Trans. Inf. Theory, vol. 62, no. 1, pp. 199-207, Jan. 2016.