In this paper, two-dimensional (2-D) correction scheme is proposed to improve the performance of conventional Min-Sum (MS) decoding of regular low density parity check codes. The adopted algorithm to obtain the correction factors is simply based on estimating the mean square difference (MSD) between the transmitted codeword and the posteriori information of both bit and check node that produced at the MS decoder. Semi-practical tests using software-defined radio (SDR) and specific code simulations show that the proposed quasi-optimal algorithm provides a comparable error performance as Sum-Product (SP) decoding while requiring less complexity.
 R. G. Gallager, “Low-Density Parity Check Codes,” IRE Transactions on Information Theory, Vol. 8, No. 1, 1962, pp. 21-28.http://dx.doi.org/10.1109/TIT.1962.1057683
 M. P. C. Fossorier, M. Mihaljevic and H. Imai, “Reduced Complexity Iterative Decoding of Low-Density Parity Check Codes Based on Belief Propagation,” IEEE Transactions on Communications, Vol. 47, No. 5, 1999, pp. 673-680.
 J. Chen and M. P. Fossorier, “Near Optimum Universal Belief Propagation Based Decoding of Low Density Parity Check Codes,” IEEE Transactions on Communications, Vol. 50, No. 3, 2002, pp. 406-414.
 V. Savin, “Self-Corrected Min-Sum Decoding of LDPC Codes,” ISIT 2008. IEEE International Symposium on information Theory, 2008. ISIT 2008, Toronto, 6-11 July 2008, pp. 146-150.
 H. Wei, J. G. Huang and F. F. Wu, “A Modified MinSum Algorithm for Low-Density Parity-Check Codes,” 2010 IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS), Beijing, 25-27 June 2010, pp. 449-451.
 X. F. Wu, Y. Song, L. Cui, M. Jiang and Ch. Zhao, “Adaptive-Normalized Min-Sum Algorithm,” 2010 2nd International Conference on Future Computer and Communication (ICFCC), Wuhan, 21-24 May 2010, pp.V2-661V2-663.
 A. A. Hamad, “Performance Enhancement of SOVA Based Decoder in SCCC and PCCC Schemes,” Scientific Research Magazine, Wireless Engineering and Technology, Vol. 4, No. 1, 2013, pp. 40-45.
 D. J. C. MacKay, “Good Error-Correcting Codes Based on Very Sparse Matrices,” IEEE Transactions on Information Theory, Vol. 45, No. 2, 1999, pp. 399-431.
 T. H. Shepertycki, “Telemetry Error Measurements Using Pseudo-Random Signals,” IEEE Transactions on Space Electronics and Telemetry, Vol. 10, No. 3, 1964, pp. 111-115. http://dx.doi.org/10.1109/TSET.1964.4335603