Lower Bound on the Critical Density in the Hard Disk Model via Optimized Metrics Thomas P. Hayes Cristopher Moore

First Page		Document Content
Date: 2014-07-18 14:13:07 Coding theory Markov models Markov chain Metric Hamming distance Disk Geometry Metric geometry Markov processes		Lower Bound on the Critical Density in the Hard Disk Model via Optimized Metrics Thomas P. Hayes Cristopher Moore Add to Reading List Source URL: www.santafe.edu Download Document from Source Website File Size: 541,01 KB Share Document on Facebook

	TD : Codes-correcteurs Christophe Ritzenthaler Codes non lin´ eaires 1. Calculer la distance de Hamming entreet). DocID: 1u82Q - View Document
	Hamming Distance Metric Learning Mohammad Norouzi† David J. Fleet† Ruslan Salakhutdinov†,‡ † DocID: 1ttPX - View Document
	Accepted Manuscript Lossless filter for multiple repetitions with Hamming distance Pierre Peterlongo, Nadia Pisanti, Frédéric Boyer, Alair Pereira do Lago, Marie-France Sagot PII: DocID: 1rVSF - View Document
	Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance Zhenjie Zhang1 1 DocID: 1q534 - View Document
	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 DocID: 1oIF2 - View Document