2000 character limit reached
Evaluation Codes in Bottleneck Metrics
Published 22 Sep 2025 in cs.IT, math.AG, and math.IT | (2509.17682v1)
Abstract: Analogs of Reed-Solomon codes are introduced within the framework of bottleneck poset metrics. These codes are proven to be maximum distance separable. Furthermore, the results are extended to the setting of Algebraic Geometry codes.
Paper Prompts
Sign up for free to create and run prompts on this paper.