Let [n, k, d] be a parameters of Goppa code Γ (L; g(z)), where g(z) is a polynomial of degree
t over GF(2m) with range L⊆GF(2m). Then encoding a message by partitioned it into blocks
of k bits and multiplying each block with the generator matrix G [17], i.e.: