Upper bounds on the rate of linear $q$-ary $k$-hash codes
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916246598975488 |
|---|---|
| author | Della Fiore, Stefano Dalai, Marco |
| author_facet | Della Fiore, Stefano Dalai, Marco |
| contents | This paper presents new upper bounds on the rate of linear $k$-hash codes in $\mathbb{F}_q^n$, $q\geq k$, that is, codes with the property that any $k$ distinct codewords are all simultaneously distinct in at least one coordinate. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_16288 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Upper bounds on the rate of linear $q$-ary $k$-hash codes Della Fiore, Stefano Dalai, Marco Information Theory Combinatorics 68R05, 11T71 This paper presents new upper bounds on the rate of linear $k$-hash codes in $\mathbb{F}_q^n$, $q\geq k$, that is, codes with the property that any $k$ distinct codewords are all simultaneously distinct in at least one coordinate. |
| title | Upper bounds on the rate of linear $q$-ary $k$-hash codes |
| topic | Information Theory Combinatorics 68R05, 11T71 |
| url | https://arxiv.org/abs/2401.16288 |