By Topic

Finite-memory classification of Bernoulli sequences using reference samples (Corresp.)

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
$33 $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

1 Author(s)

It is shown that in two-way Bernoulli classification problems deterministic machines can perform as well as optimal randomized machines if their memory is increased by less than one bit. This is accomplished by allowing the algorithm to observe samples from both classes, thus in effect using the data source itself to provide the necessary randomization. An application to a simple communication problem is indicated.

Published in:

IEEE Transactions on Information Theory  (Volume:20 ,  Issue: 3 )