A new upper bound for codes with a single Hamming distance
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929516328255488 |
|---|---|
| author | Hegedüs, Gábor |
| author_facet | Hegedüs, Gábor |
| contents | In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_07877 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A new upper bound for codes with a single Hamming distance Hegedüs, Gábor Combinatorics Metric Geometry 05D05, 12D99, 15A03 In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method. |
| title | A new upper bound for codes with a single Hamming distance |
| topic | Combinatorics Metric Geometry 05D05, 12D99, 15A03 |
| url | https://arxiv.org/abs/2409.07877 |