Nonlinear codes for belief propagation
Eimear Byrne, Christine A. Kelley, Chris Monico, Joachim Rosenthal · 2003
We consider codes defined by a system of sparse polynomial parity check equations in F /sub 2/[x/sub 1/,...,x/sub n/]. We suggest that, defined in the right way, such codes admit an encoding comparable in efficiency with their linear counterparts (LDPC codes), and are suitable for iterative decoding.