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

2024/01/29 by Della Fiore, Stefano, Dalai, Marco · 2 citations
#11T71 #68R05 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2401.16288

Abstract

This paper presents new upper bounds on the rate of linear k-hash codes in \mathbbF_qⁿ, q≥ k, that is, codes with the property that any k distinct codewords are all simultaneously distinct in at least one coordinate.

Cited by

• Polynomially Improved Lower Bounds for Trifferent Codes via Locally Sparse 3-Uniform Hypergraphs
• Vector Trifference

Related

• Bounds on k-hash distances and rates of linear codes
• Beating Fredman-Komlós for perfect k-hashing
• Beating the probabilistic lower bound on q-perfect hashing
• Improved asymptotic bounds for codes using distinguished divisors of global function fields
• A note on 2-separable codes and B₂ codes