Deep Holes of Projective Reed-Solomon Codes
From MaRDI portal
Publication:5123863
Abstract: Projective Reed-Solomon (PRS) codes are Reed-Solomon codes of the maximum possible length q+1. The classification of deep holes --received words with maximum possible error distance-- for PRS codes is an important and difficult problem. In this paper, we use algebraic methods to explicitly construct three classes of deep holes for PRS codes. We show that these three classes completely classify all deep holes of PRS codes with redundancy at most four. Previously, the deep hole classification was only known for PRS codes with redundancy at most three in work arXiv:1612.05447
Cited in
(15)- On deep holes of Gabidulin codes
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
- Deep holes in Reed-Solomon codes based on Dickson polynomials
- On Determining Deep Holes of Generalized Reed-Solomon Codes
- On Determining Deep Holes of Generalized Reed–Solomon Codes
- Deep holes of generalized Reed-Solomon codes
- Determining deep hole trees of generalized Reed-Solomon codes and an application
- Holes in Generalized Reed–Muller Codes
- On Deciding Deep Holes of Reed-Solomon Codes
- On the weight distribution of the cosets of MDS codes
- New MDS and self-dual generalized Roth-Lempel codes as well as their deep holes
- The weight distributions of three new classes of binary linear codes
- Deep holes of twisted Reed-Solomon codes
- Smooth symmetric systems over a finite field and applications
- Dual and covering radii of extended algebraic geometry codes
This page was built for publication: Deep Holes of Projective Reed-Solomon Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5123863)