Abstract:
We consider Generalized Minimum Distance (GMD) decoding, proposed by G. D.
Forney, Jr (1966). Let a received vector r and an ordering of the
positions in r according to some reliability information be give. On of
the key problems in GMD decoding is to decode a collection of vectors
obtained from r by erasing more and more positions. We solve the problem
of finding error and erasure positions in different r's efficiently by
using relations between the decoding branches correcting different numbers
of erasures.