An upper bound on the size of a code with $s$ distances
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913732291985408 |
|---|---|
| author | Landjev, Ivan Vorobev, Konstantin |
| author_facet | Landjev, Ivan Vorobev, Konstantin |
| contents | Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_08948 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An upper bound on the size of a code with $s$ distances Landjev, Ivan Vorobev, Konstantin Combinatorics Information Theory 05A05, 05A20, 94B25, 94B65 Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal. |
| title | An upper bound on the size of a code with $s$ distances |
| topic | Combinatorics Information Theory 05A05, 05A20, 94B25, 94B65 |
| url | https://arxiv.org/abs/2503.08948 |