The Hamming SECSED code with 4 message bits and 3 check bits is used in the text as an example (Section 2.4.3). It was stated that we could use a brute force technique of checking all the legal or illegal code words for error detection, as was done for the parity-bit code in Fig. 2.1.
(a) List all the legal and illegal code words for this example and show that the code distance is 3.
(b) Design an error-detector circuit using minimized two-level logic (cf. Fig. 2.1).
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here