On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany

First Page		Document Content
Date: 2015-02-05 05:37:41 Coding theory Error detection and correction Numerical analysis Finite fields Search algorithms Linear code Nearest neighbor search Algorithm Linear algebra Hamming distance List decoding Decoding methods		On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany Add to Reading List Source URL: www.cits.rub.de Download Document from Source Website File Size: 619,91 KB Share Document on Facebook

	Distributed Computing Prof. R. Wattenhofer BA/MA/SA/Group: Nearest Neighbor Search in Ultrametric Spaces DocID: 1tUny - View Document
	1 Product quantization for nearest neighbor search Herv´e J´egou, Matthijs Douze, Cordelia Schmid Abstract— This paper introduces a product quantization DocID: 1tzgx - View Document
	Multi-View Complementary Hash Tables for Nearest Neighbor Search Xianglong Liu† Lei Huang† Cheng Deng‡ Jiwen Lu ♮ Bo Lang† DocID: 1ttOD - View Document
	Locally Optimized Product Quantization for Approximate Nearest Neighbor Search Yannis Kalantidis and Yannis Avrithis National Technical University of Athens {ykalant, iavr}@image.ntua.gr DocID: 1tt48 - View Document
	Song Intersection by Approximate Nearest Neighbor Search Michael Casey Malcolm Slaney Goldsmiths College DocID: 1tkRr - View Document