BEARdocs

A Search Strategy Using a Hamming-Distance Oracle

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Maurer, Peter M.
dc.identifier.uri http://hdl.handle.net/2104/5362
dc.description.abstract The objective of the algorithm described in this report is to optimally guess a hidden binary string based on queries to an oracle where the length of the string is known beforehand. A C++ version of the algorithm is given along with a theoretical discussion of why the algorithm works. A discussion of the worst and average-case performance is given along with some discussion of optimality. en
dc.subject Hamming-Distance Oracle en
dc.subject Algorithms en
dc.title A Search Strategy Using a Hamming-Distance Oracle en
dc.license GPL en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search BEARdocs


Advanced Search

Browse

My Account

Statistics