2000 character limit reached
On Deep Holes of Projective Reed-Solomon Codes
Published 9 May 2016 in cs.IT and math.IT | (1605.02423v1)
Abstract: In this paper, we obtain new results on the covering radius and deep holes for projective Reed-Solomon (PRS) codes.
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.