Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem

DOI10.1109/TIT.2010.2050814zbMath1368.68209arXiv0810.4182MaRDI QIDQ5281372

Moshe Dubiner

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.4182

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (9)

A new coding-based algorithm for finding closest pair of vectors ⋮ Detecting the large entries of a sparse covariance matrix in sub-quadratic time ⋮ Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time ⋮ Identifying an unknown code by partial Gaussian elimination ⋮ Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ ⋮ Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem ⋮ ForestDSH: a universal hash design for discrete probability distributions ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem