This work treats a way to obtain the parity check codes through geometric Goppa codes. Two cases have been considered depending on the taken field characteristic as alphabet and on the code length. It has been used the technique of linear code restriction. More precisely, it has been showed that the parity check codes are obtained as the restriction of a rational geometric Goppa code.
