By Topic

Comments on "Novel totally self-checking Berger checker designs based on generalized Berger code partitioning

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)
S. J. Piestrak ; Inst. of Eng. Cybern., Tech. Univ. Wroclaw, Poland

For original paper see ibid., vol.42, no.8, p.1020-4 (1994). T.R.N. Rao et al. (1994) proposed a totally self-checking (TSC) 2-output checker for Berger codes with I=2/sup r-1/ information bits. The article shows that their checker may not be self-testing, as claimed. Hence, the circuit proposed by S.J. Piestrak (2002) is the first correct solution of this design problem.

Published in:

IEEE Transactions on Computers  (Volume:51 ,  Issue: 6 )