Deep Holes of Twisted Reed-Solomon Codes
Abstract: The deep holes of a linear code are the vectors that achieve the maximum error distance (covering radius) to the code. {Determining the covering radius and deep holes of linear codes is a fundamental problem in coding theory. In this paper, we investigate the problem of deep holes of twisted Reed-Solomon codes.} The covering radius and a standard class of deep holes of twisted Reed-Solomon codes ${\rm TRS}_k(\mathcal{A}, \theta)$ are obtained for a general evaluation set $\mathcal{A} \subseteq \mathbb{F}_q$. Furthermore, we consider the problem of determining all deep holes of the full-length twisted Reed-Solomon codes ${\rm TRS}_k(\mathbb{F}_q, \theta)$. For even $q$, by utilizing the polynomial method and Gauss sums over finite fields, we prove that the standard deep holes are all the deep holes of ${\rm TRS}_k(\mathbb{F}_q, \theta)$ with $\frac{3q-4}{4} \leq k\leq q-4$. For odd $q$, we adopt a different method and employ the results on some equations over finite fields to show that there are also no other deep holes of ${\rm TRS}_k(\mathbb{F}_q, \theta)$ with $\frac{3q+3\sqrt{q}-7}{4} \leq k\leq q-4$. In addition, for the boundary cases of $k=q-3, q-2$ and $q-1$, we completely determine their deep holes using results on certain character sums.
- A. McLoughlin, “The complexity of computing the covering radius of a code,” IEEE Trans. Inf. Theory, vol. IT-30, no. 6, pp. 800–804, Nov. 1984.
- A. Dur, “On the covering radius of Reed-Solomon codes,” Discrete Math., vol. 126, pp. 99–105, 1994.
- O.S. Rothaus, “On ‘bent’ functions,” J. Combin. Theory Ser. A, vol. 20, pp. 300–305, 1976.
- Q. Cheng and E. Murray, “On deciding deep holes of Reed–Solomon codes,” in Theory and Applications of Models of Computation (Lecture Notes in Computer Science), vol. 4484. Berlin, Germany: Springer, pp. 296–305, 2007.
- J. Li and D. Wan, “On the subset sum problem over finite fields,” Finite Fields Appl., vol. 14, no. 4, pp. 911–929, 2008.
- Y. Li and D. Wan, “On error distance of Reed–Solomon codes,”Sci. China A, Math., vol. 51, no. 11, pp. 1982–1988, 2008.
- J. Li and D. Wan, “A new sieve for distinct coordinate counting,”Sci. China Math., vol. 53, no. 9, pp. 2351–2362, 2010.
- R. Wu and S. Hong, “On deep holes of standard Reed–Solomon codes,” Sci. China Math., vol. 55, no. 12, pp. 2447–2455, 2012.
- G. Zhu and D. Wan, “Computing error distance of Reed–Solomon codes,” in Theory and Applications of Models of Computation (Lecture Notes in Computer Science), vol. 7287. Berlin, Germany: Springer-Verlag, pp. 214–224.
- A. Cafure, G. Matera, and M. Privitelli, “Singularities of symmetric hypersurfaces and an application to Reed–Solomon codes,” Adv. Math. Commun., vol. 6, no. 1, pp. 69–94, 2012.
- J. Zhang, F.-W. Fu, and Q.-Y. Liao, “New deep holes of generalized Reed–Solomon codes,” Sci. Sin. Math., vol. 43, no. 7, pp. 727–740, 2013.
- M. Keti and D. Wan, “Deep holes in Reed–Solomon codes based on Dickson polynomials,” Finite Fields Their Appl., vol. 40, pp. 110–125, Jul. 2016.
- 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.
- K. Kaipa, “Deep holes and MDS extensions of Reed–Solomon codes,” IEEE Trans. Inf. Theory, vol. 63, no. 8, pp. 4940–4948, Aug. 2017.
- 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, Apr. 2020.
- V. Guruswami and A. Vardy, “Maximum-likelihood decoding of Reed–Solomon codes is NP-hard,” IEEE Trans. Inf. Theory, vol. 51, no. 7, pp. 2249–2256, Jul. 2005.
- 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, May 1986.
- P. Beelen, S. Puchinger, and J. R. N. Nielsen, “Twisted Reed–Solomon codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2017, pp. 1–15.
- P. Beelen, S. Puchinger, and J. Rosenkilde, “Twisted Reed–Solomon codes,” IEEE Trans. Inf. Theory, vol. 68, no. 5, pp. 3047–3061, May 2022.
- D. Huang, Q. Yue, Y. Niu, and X. Li, “MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes,” Des., Codes Cryptogr., vol. 89, no. 9, pp. 2195–2209, Sep. 2021.
- H. Liu and S. Liu, “Construction of MDS twisted Reed–Solomon codes and LCD MDS codes,” Des., Codes Cryptogr., vol. 89, no. 9, pp. 2051–2065, Sep. 2021.
- J. Sui, Q. Yue, X. Li, and D. Huang, “MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes,” IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7832-7841, Dec. 2022.
- J. Zhang, Z. Zhou, and C. Tang, “A class of twisted generalized Reed–Solomon codes,” Des., Codes Cryptogr., vol. 90, no. 7, pp. 1649–1658, Jul. 2022.
- J. Sui, Q. Yue, X. Li, and D. Huang, “MDS, near-MDS or 2-MDS self-dual codes via twisted generalized Reed–Solomon codes,” IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7832–7841, Dec. 2022.
- P. Beelen, M. Bossert, S. Puchinger, and J. Rosenkilde, “Structural properties of twisted Reed–Solomon codes with applications to cryptography,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2018, pp. 946–950.
- J. Lavauzelle and J. Renner, “Cryptanalysis of a system based on twisted Reed–Solomon codes,” Des., Codes Cryptogr., vol. 88, no. 7, pp. 1285–1300, Jul. 2020.
- D. Hiren, “The MDS Conjecture and related questions in finite geometry,” Master Thesis, 2019.
- J. T. Schwartz, “Fast probabilistic algorithms for verification of polynomial identities,” J. ACM, vol. 27, no. 4, pp.701–717, 1980.
- R. Zippel, “Probabilistic algorithms for sparse polynomials,” In Proceedings of the International Symposium on Symbolic and Algebraic Computation, Springer-Verlag, pp. 216–226, 1979
- D. Schipani and M. Elia, “Gauss sums of the cubic character over GF(2m)𝐺𝐹superscript2𝑚GF(2^{m})italic_G italic_F ( 2 start_POSTSUPERSCRIPT italic_m end_POSTSUPERSCRIPT ): an elementary derivation,” Bull. Pol. Acad. Sci. Math. vol. 59, pp. 11–18, 2011.
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.