Issue No.08 - August (1984 vol.33)
James E. Smith , Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI 53706.
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 2<sup>k</sup> possible k-tuples are used is considered. For an arbitrary set of k-tuples, the minimum number of check bits is shown.
James E. Smith, "On Separable Unordered Codes", IEEE Transactions on Computers, vol.33, no. 8, pp. 741-743, August 1984, doi:10.1109/TC.1984.5009361