Totally self-checking decoders for Hamming SEC codes
暂无分享，去创建一个
It is shown that there exist totally self-checking (TSC) combinational decoders for (n,k) Hamming single error correcting (SEC) codes if and only if n=2/sup r/-1, r=n-k. For shortened (n,k) Hamming SEC codes the modified combinational totally self-checking decoders with minimum testing delay 2/spl les//spl mu/<(n-k) are suggested.
[1] Rodney M. Goodman,et al. The reliability of semiconductor RAM memories with on-chip error-correction coding , 1991, IEEE Trans. Inf. Theory.
[2] Eiji Fujiwara,et al. Error-control coding for computer systems , 1989 .
[3] F. Joel Ferguson. Book Review: Logic Design Principles by Edward J. McCluskey: Prentice-Hall Publishers, Englewood Cliffs, New Jersey, 549 pp., $39.95 , 1988, CARN.
[4] James E. Smith,et al. Strongly Fault Secure Logic Networks , 1978, IEEE Transactions on Computers.