Uniquely optimal codes of low complexity are symmetric
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908730853949440 |
|---|---|
| author | King, Emily J. Mixon, Dustin G. Parshall, Hans Wells, Chris |
| author_facet | King, Emily J. Mixon, Dustin G. Parshall, Hans Wells, Chris |
| contents | We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2008_12871 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Uniquely optimal codes of low complexity are symmetric King, Emily J. Mixon, Dustin G. Parshall, Hans Wells, Chris Combinatorics Information Theory Metric Geometry 05B40, 94B99, 51F99 We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested. |
| title | Uniquely optimal codes of low complexity are symmetric |
| topic | Combinatorics Information Theory Metric Geometry 05B40, 94B99, 51F99 |
| url | https://arxiv.org/abs/2008.12871 |