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

Abstract

This paper presents new upper bounds on the rate of linear $k$-hash codes in ${\mathbb{F}}_q^n$, $q\ge k$, that is, codes with the property that any $k$ distinct codewords are all simultaneously distinct in at least one coordinate.