Funder
National Science Foundation
National Science Foundation Division of Computing and Communication Foundations
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. A bound on the zero-error list coding capacity;Arikan,1993
2. An upper bound on the zero-error list-coding capacity;Arikan;IEEE Trans. Inf. Theory,1994
3. New bounds for perfect k-hashing;Costa;Discrete Appl. Math.,2021
4. An improved bound on the zero-error list-decoding capacity of the 4/3 channel;Dalai,2017
5. Zero error capacity under list decoding;Elias;IEEE Trans. Inf. Theory,1988
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Trifferent codes with small lengths;Examples and Counterexamples;2024-06
2. Blocking sets, minimal codes and trifferent codes;Journal of the London Mathematical Society;2024-05-26
3. Bounds for c-Ideal Hashing;Fundamentals of Computation Theory;2023
4. Improved Bounds for (b, k)-Hashing;IEEE Transactions on Information Theory;2022-08