Upper bounds on the rate of linear $q$-ary $k$-hash codes

Author:

Stefano Della Fiore, Marco Dalai

Keyword:

Computer Science, Information Theory, Information Theory (cs.IT), Combinatorics (math.CO)

journal:

date:

2024-01-29 00:00:00

Abstract

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.

PDF: Upper bounds on the rate of linear $q$-ary $k$-hash codes.pdf