An upper bound on the zero-error list-coding capacity
From MaRDI portal
Publication:4324191
DOI10.1109/18.335947zbMath0818.94012OpenAlexW1997218732MaRDI QIDQ4324191
Publication date: 1 March 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/13611
Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items
New bounds for perfect \(k\)-hashing, Recursive bounds for perfect hashing, Beating Fredman-Komlós for Perfect k-Hashing., Beating Fredman-Komlós for perfect \(k\)-hashing
