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

MaRDI QIDQ6519397arXivFDO

Authors Stefano Della Fiore, Marco Dalai

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

This page was built for publication: Upper bounds on the rate of linear $q$-ary $k$-hash codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6519397)