A Search Strategy Using a Hamming-Distance Oracle

Simple item page
dc.contributor.authorMaurer, Peter M.
dc.date.accessioned2009-08-04T16:47:04Z
dc.date.available2009-08-04T16:47:04Z
dc.date.issued2009-08-04T16:47:04Z
dc.description.abstractThe 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.format.extent112420 bytes
dc.format.mimetypeapplication/msword
dc.identifier.urihttp://hdl.handle.net/2104/5362
dc.language.isoen_US
dc.licenseGPLen
dc.subjectHamming-Distance Oracleen
dc.subjectAlgorithmsen
dc.titleA Search Strategy Using a Hamming-Distance Oracleen

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A Search Strategy Using a Hamming.docx
Size:
109.79 KB
Format:
Microsoft Word
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.96 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computer Science Technical Reports