no code implementations • 26 Jan 2021 • Stefano Della Fiore, Simone Costa, Marco Dalai
For fixed integers $b\geq k$, the problem of perfect $(b, k)$-hashing asks for the asymptotic growth of largest subsets of $\{1, 2,\ldots, b\}^n$ such that for any $k$ distinct elements in the set, there is a coordinate where they all differ.
Information Theory Combinatorics Information Theory 68R05
no code implementations • 25 Jan 2021 • Marco Bondaschi, Albert Guillén i Fàbregas, Marco Dalai
We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes.
Information Theory Information Theory
