For the binary code consisting of 8 codewords which encode the messages 000 to 111 as follows:

000 => 11110000 001 => 11111111 010 => 00111111 011 => 11111100 100 => 00111100 101 => 11000011 110 => 00000000 111 => 00001111

For the code above answer: Is it linear? What is its block length, message length, rate and distance? How many errors can it detect, and how many can it correct? ( to answer this question you should give the largest number of errors that the code can guarantee to detect or correct. for example a simple parity bit can detect 1 or 3 errors but cannot detect 2 errors so we would say this can detect only a single error. no calculations of probability are required. STATE WITH JUSTIFICATION.