Consider the following code mapping for k= 2 bits of information with n = 5. How...

 

Transcribed Image Text:

Consider the following code mapping for k= 2 bits of information with n = 5. How many errors at maximum can this code correct? Information bits 00 01 10 11 Codeword 00000 00111 11100 11011 What are the generator and parith check matrices of the code? (Enough to provide one valid parity check matrix). Consider the following code mapping for k= 2 bits of information with n = 5. How many errors at maximum can this code correct? Information bits 00 01 10 11 Codeword 00000 00111 11100 11011 What are the generator and parith check matrices of the code? (Enough to provide one valid parity check matrix).