Computation of the right-inverse of G(D) and the left-inverse of Ht(D)

In a typical binary coded digital communication system, convolutional codes are often used for error-protection. Very simply, an encoder for an (n,k) linear convolutional code can be described by a k*n matrix G(D). Useful column and row operations are given for the computation of the right-inverse G^-1(D) of an k*n generator matrix G(D) and the left-inverse (H^t(D))^-1 of the transpose of an (n-k)*n parity-check matrix H(D). The methods are illustrated with two examples.