Sparse ternary codes for similarity search have higher coding gain than dense binary codes

Sohrab Ferdowsi, Slava Voloshynovskiy, Dimche Kostadinov, Taras Holotyak. Sparse ternary codes for similarity search have higher coding gain than dense binary codes. In 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017. pages 2653-2657, IEEE, 2017. [doi]

@inproceedings{FerdowsiVKH17,
  title = {Sparse ternary codes for similarity search have higher coding gain than dense binary codes},
  author = {Sohrab Ferdowsi and Slava Voloshynovskiy and Dimche Kostadinov and Taras Holotyak},
  year = {2017},
  doi = {10.1109/ISIT.2017.8007010},
  url = {https://doi.org/10.1109/ISIT.2017.8007010},
  researchr = {https://researchr.org/publication/FerdowsiVKH17},
  cites = {0},
  citedby = {0},
  pages = {2653-2657},
  booktitle = {2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017},
  publisher = {IEEE},
  isbn = {978-1-5090-4096-4},
}