Upper bounds on the rate of linear $q$-ary $k$-hash codes
Information Theory
2024-05-16 v3 Combinatorics
math.IT
Abstract
This paper presents new upper bounds on the rate of linear -hash codes in , , that is, codes with the property that any distinct codewords are all simultaneously distinct in at least one coordinate.
Cite
@article{arxiv.2401.16288,
title = {Upper bounds on the rate of linear $q$-ary $k$-hash codes},
author = {Stefano Della Fiore and Marco Dalai},
journal= {arXiv preprint arXiv:2401.16288},
year = {2024}
}