![]() Solution : The general pattern of the block codes is (n, h), hence, in this case, n = 6 and k= 3. The generator matrix for a (6, 3) block code is given below. If generator matrix G has been given then we can obtain the parity check matrix and vice-versa.ĮXAMPLE 10.5. The matrix H is called as the parity check matrix. The transpose of the coefficient matrix can be obtained by interchanging the rows and columns of the coefficient matrix P given by equation (10.9), i.e., Where P T = An (n – k) x k matrix representing the transpose of the coefficient matrix P and I n-k is an (n – k) x (n – k) identify matrix. Let H denote an (n – k) x n matrix defined as under : There is another way of expressing the relationship between the message bits and the parity check bits, of a linear block code. Thus, with d min= 3, it is possible to detect upto 2 errors and it is possible to correct upto only 1 error. The number of errors that can be corrected per word = 1. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |