Upper bounds on the size of grain-correcting codes

Navin Kashyapt, Gilles Zemori. Upper bounds on the size of grain-correcting codes. In Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013. pages 136-140, IEEE, 2013. [doi]

@inproceedings{KashyaptZ13,
  title = {Upper bounds on the size of grain-correcting codes},
  author = {Navin Kashyapt and Gilles Zemori},
  year = {2013},
  doi = {10.1109/ISIT.2013.6620203},
  url = {http://dx.doi.org/10.1109/ISIT.2013.6620203},
  researchr = {https://researchr.org/publication/KashyaptZ13},
  cites = {0},
  citedby = {0},
  pages = {136-140},
  booktitle = {Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013},
  publisher = {IEEE},
}