More MDS codes of non-Reed-Solomon type
Abstract: MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. In this paper, we focus on a class of linear codes and establish some sufficient and necessary conditions for them being MDS. Notably, these codes differ from Reed-Solomon codes up to monomial equivalence. Additionally, we also explore the cases in which these codes are almost MDS or near MDS. Applying our main results, we determine the covering radii and deep holes of the dual codes associated with specific Roth-Lempel codes and discover an infinite family of (almost) optimally extendable codes with dimension three.
- C. Carlet, C. Li, S. Mesnager, “Some (almost) optimally extendable linear codes,” Des. Codes Cryptogr., vol. 87, pp. 2813-2834, 2019.
- D. Han, C. Fan, “Roth-Lempel NMDS codes of non-elliptic-curve type,” IEEE Trans. Inf. Theory, vol. 69, no. 9, pp. 5670-5675, 2023.
- X. Quan, Q. Yue, L. Hu, “Some constructions of (almost) optimally extendable linear codes,” Adv. Math. Commun., 2022. Doi: 10.3934/amc.2022027
- 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.
- Z. Sun, C. Ding, and T. Chen, “The extended codes of some linear codes,” arXiv preprint arXiv:2307.08053, 2023.
- H. Van de Vel, “Numerical treatment of a generalized Vandermonde system of equations,” Linear Algebra Appl., vol. 17, pp. 149–179, 1977.
- Y. Wu, C, Ding, T, Chen, “Extended codes and deep holes of MDS codes,” arXiv preprint arXiv: 2312.05534, 2023.
- Y. Wu, J. Y. Hyun, Y. Lee, “New LCD MDS codes of non-Reed-Solomon type,” IEEE Trans. Inf. Theory, vol. 67, no. 8, pp. 5069-5078, 2021.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
