Fast and Efficient Totally Self-Checking Checkers for m-out-of-(2m ± 1) Codes

DOI10.1109/TC.1983.1676265MaRDI QIDQ3309736zbMATH OpenOpenAlexFDO

Authors Constantine Halatsis, Nicolaos Gaitanis, Maria Sigala

Publication date 1983

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1983.1676265

zbMATH Keywords

m-out-of-n codestotally self-checking checkers

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

This page was built for publication: Fast and Efficient Totally Self-Checking Checkers for m-out-of-(2m ± 1) Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309736)