By Topic

Optimal versus randomized search of fixed length words

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Prodinger, H. ; Sch. of Math., Univ. of the Witwatersrand, South Africa ; Szpankowski, W.

A combinatorial search problem can be defined as follows: Given a set W={w 1, w2,..., wm} of m words over a (binary) alphabet Σ, design a sequence of tests that successfully find the word w* ∈ W being sought. The prime goal of the optimal search is to find the sought word w* with the smallest maximum or average search time. Here, we deal with a randomly selected set W of m binary words of fixed length n, that is, the set W={w1,... wm} is chosen with equal probability among all possible subsets of size m.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: