Soft decoding of products of arbitrary dimension codes based on codes with single parity checking

This paper presents the research of cellular automata algorithms in application to the iterative transformation procedure for product codes with the singular parity-check. The possibility of using similar codes constructions for the over 3-dimensional product codes formation is shown. There is also generalized the decoding procedure with the cellular automata model for the 3D case.