Evaluation Codes in Bottleneck Metrics
arXiv:2509.17682
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.