  Iterative decoding of non-binary LDPC codes is currently performed using
either the Sum-Product or the Min-Sum algorithms or slightly different versions
of them. In this paper, several low-complexity quasi-optimal iterative
algorithms are proposed for decoding non-binary codes. The Min-Max algorithm is
one of them and it has the benefit of two possible LLR domain implementations:
a standard implementation, whose complexity scales as the square of the Galois
field's cardinality and a reduced complexity implementation called selective
implementation, which makes the Min-Max decoding very attractive for practical
purposes.
