Evaluation Codes in Bottleneck Metrics
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914050651193344 |
|---|---|
| author | Can, Mahir Bilen Montero, Dillon Özbudak, Ferruh |
| author_facet | Can, Mahir Bilen Montero, Dillon Özbudak, Ferruh |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_17682 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Evaluation Codes in Bottleneck Metrics Can, Mahir Bilen Montero, Dillon Özbudak, Ferruh Information Theory Algebraic Geometry 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. |
| title | Evaluation Codes in Bottleneck Metrics |
| topic | Information Theory Algebraic Geometry |
| url | https://arxiv.org/abs/2509.17682 |