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

On Error Control in Sequential Machines

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

1 Author(s)
Mandelbaum, David ; Avionics Laboratory, U. S. Army Electronics Command

It is shown that if a machine M con be mapped into a simpler machine M' by a homomorphism, then an error correcting/detecting code can be applied to the states of M such that the parity check bits are generated independently of the information bits that form the state assignment of M. If such a homomorphism does not exist, it is shown how to produce one by altering M if M consists entirely of loops as is the case with a digital computer. The method presented here is a generalization to sequential machines of the separate adder and checker concept used for checking addition. Methods of coding are given. Application to computers is given.

Published in:

Computers, IEEE Transactions on  (Volume:C-21 ,  Issue: 5 )

Date of Publication:

May 1972

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.