The iterative algorithm of digital reconstruction of coding imaging is studied by matrix analysis. We use regularization method to overcome the ill posed problem. The convergence and error of the algorithm is studied. It is shown that the nosie can be compressed, but some local structure is distorted. The computation complexity of the algorithm is analysed.