Code bounds for multiple packings over a nonbinary finite alphabet
Problems of Information Transmission
Two problems from coding theory
General Theory of Information Transfer and Combinatorics
On the list-decodability of random linear codes
Proceedings of the forty-second ACM symposium on Theory of computing
A lower bound on list size for list decoding
IEEE Transactions on Information Theory
On the list decodability of random linear codes with large error rates
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.06 |
The paper completes the proof of an upper bound for multiple packings in a q-ary Hamming space.