Cart (Loading....) | Create Account
Close category search window
 

A finite-memory deterministic algorithm for the symmetric hypothesis testing problem

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)

A class of irreducible deterministic finite-memory algorithms for the symmetric hypothesis testing problem is studied. It is shown how members of this class can be constructed to give a steady-state probability of error that decreases asymptotically faster in the number of states than the best previously known deterministic algorithm.

Published in:

Information Theory, IEEE Transactions on  (Volume:21 ,  Issue: 1 )

Date of Publication:

Jan 1975

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.