Asymptotic Combinatorial Coding Theory
Asymptotic Combinatorial Coding Theory
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
On the convexity of one coding-theory function
Problems of Information Transmission
Plotkin bound generalization to the case of multiple packings
Problems of Information Transmission
Generalization of Plotkin bound to the case of multiple packing
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
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 problem of constructing asymptotic bounds for multiple packings in the space of q-ary sequences of length n is considered. For the zero rate, tightness of the expurgation bound is proved.