We propose a multiclass-to-binary decomposition strategy founded on Coding Theory.

We use Low-Density Parity-Check codes, a very effective family of binary block codes.

Exploiting the algebraic properties of the code, we handle both coding and decoding.

Two decoding rules are proposed that provide many advantages over known strategies.

Several experiments are performed that show significant performance improvements.