DocumentCode :
2391480
Title :
Totally self-checking decoders for Hamming SEC codes
Author :
Boyarinov, I.M.
Author_Institution :
Inst. for Syst. Anal., Acad. of Sci., Moscow, Russia
fYear :
2000
fDate :
2000
Firstpage :
397
Abstract :
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=2r-1, r=n-k. For shortened (n,k) Hamming SEC codes the modified combinational totally self-checking decoders with minimum testing delay 2⩽μ<(n-k) are suggested
Keywords :
Hamming codes; combinational circuits; decoding; error correction codes; Hamming single error correcting codes; combinational decoders; minimum testing delay; totally self-checking decoders; Automatic testing; Built-in self-test; Circuit faults; Circuit testing; Decoding; Delay; Electrical fault detection; Fault detection; Logic testing; Maintenance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
Type :
conf
DOI :
10.1109/ISIT.2000.866695
Filename :
866695
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2391480
بازگشت