Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909572858380288 |
|---|---|
| author | Hu, Sihuang Huang, Hexiang Yu, Wei-Hsuan |
| author_facet | Hu, Sihuang Huang, Hexiang Yu, Wei-Hsuan |
| contents | An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_07036 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces Hu, Sihuang Huang, Hexiang Yu, Wei-Hsuan Combinatorics Combinatorics An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces. |
| title | Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces |
| topic | Combinatorics Combinatorics |
| url | https://arxiv.org/abs/2504.07036 |