Abstract: In this research paper we discover two different schemes of error detection and correction which are based on parity-check code for optimal error detection and correction utilizing check bits without degrading the data rate too much. The scheme of the first method is obtained by arranging data in rows, to form a square, and then parity bits are added. The second scheme builds upon the first, by forming a square cube and the parity scheme is extended to this shape.