Code bounds for multiple packings over a nonbinary finite alphabet

@article{Blinovsky2005CodeBF,
  title={Code bounds for multiple packings over a nonbinary finite alphabet},
  author={Vladimir M. Blinovsky},
  journal={Probl. Inf. Transm.},
  year={2005},
  volume={41},
  pages={23-32}
}

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

Combinatorial Limitations of Average-Radius List-Decoding

IEEE Transactions on Information Theory • 2014
View 12 Excerpts
Highly Influenced

Limits to List Decoding of Random Codes

IEEE Transactions on Information Theory • 2009
View 4 Excerpts
Highly Influenced

A Lower Bound on List Size for List Decoding

IEEE Transactions on Information Theory • 2005
View 4 Excerpts
Highly Influenced

Upper Bound on List-Decoding Radius of Binary Codes

IEEE Transactions on Information Theory • 2015
View 1 Excerpt

On the List-Decodability of Random Linear Codes

IEEE Transactions on Information Theory • 2010
View 1 Excerpt

Generalization of Plotkin bound to the case of multiple packing

2009 IEEE International Symposium on Information Theory • 2009