1 problem

Let $q$ and $k$ be integers satisfying $q geq 2k-3$ and $kgeq 3$. Theorem states that the bound of Corollary improves the Kb6rnerb6Marton bound for general $(q,k)$-hash codes. Conj…