On Separable Unordered Codes
- 1 August 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (8) , 741-743
- https://doi.org/10.1109/tc.1984.5009361
Abstract
Unordered codes have proven useful for designing failsafe, fault-secure, and self-checking logic circuits. In many applications it may be desirable to have separate information bits and check bits, i.e., a separable code. This correspondence gives a procedure for adding check bits to a set of information k-tuples to produce an unordered code. The general case where not all 2k possible k-tuples are used is considered. For an arbitrary set of k-tuples, the minimum number of check bits is shown.Keywords
This publication has 9 references indexed in Scilit:
- Modified Berger Codes for Detection of Unidirectional ErrorsIEEE Transactions on Computers, 1984
- Unified Design of Self-Checking and Fail-Safe Combinational Circuits and Sequential MachinesIEEE Transactions on Computers, 1979
- Strongly Fault Secure Logic NetworksIEEE Transactions on Computers, 1978
- Asynchronous State Assignments with Unateness Properties and Fault-Secure DesignIEEE Transactions on Computers, 1978
- On Totally Self-Checking Checkers for Separable CodesIEEE Transactions on Computers, 1977
- Design of Totally Self-Checking Check Circuits for m-Out-of-n CodesIEEE Transactions on Computers, 1973
- Realization of Fail-Safe Sequential Machines by Using a k-out-of-n CodeIEEE Transactions on Computers, 1971
- A note on error detection codes for asymmetric channelsInformation and Control, 1961
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950