On Deep Holes of Projective Reed-Solomon Codes
Jun Zhang, Daqing Wan
TL;DR
This paper investigates the properties of deep holes and the covering radius in projective Reed-Solomon codes, providing new insights into their structure and limitations.
Contribution
It presents novel results on the covering radius and deep holes specific to projective Reed-Solomon codes, advancing understanding in coding theory.
Findings
New bounds on the covering radius of PRS codes
Characterization of deep holes in PRS codes
Improved understanding of code structure
Abstract
In this paper, we obtain new results on the covering radius and deep holes for projective Reed-Solomon (PRS) codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cryptographic Implementations and Security