Vectorizing computations at decoding of nonbinary codes with small density of checks

A modification of the decoding $q$-ary Sum Product Algorithm ($q$-SPA) was proposed for the nonbinary codes with small check density based on the permutation matrices. The algorithm described has a vector realization and operates over the vectors defined on the field $GF(q)$, rather than over individual symbols. Under certain code parameters, this approach enables significant speedup of modeling.

Presented by the member of Editorial Board: B. T. Polyak