We introduce a new distance measure which permits likelihood information to be used in
algebraic minimum distance decoding techniques. We give an efficient decoding algorithm, …

… In this section, we introduce the channel model needed for our version of GMD decoding.
Earlier … Next, we develop a criterion for successful bounded distance decoding that uses vector …

Generalized minimum-distance (GMD) decoding is a standard soft-decoding method for block
codes. We derive an efficient general GMD decoding scheme for linear block codes in the …

… We define a bounded-distance decoder for as a decoding algorithm with the … the decoder
is guaranteed to decode to . Sometimes, such decoders are called bounded-distance decoders …

… multistage generalized minimumdistance (GMD) decoding of … GMD decoder using this metric
is a boundeddistance decoder … The effective error coefficient of multistage GMD decoding is …

… In this paper, generalized minimum distance decoding was reviewed and modified to admit
retransmissions €or use in a hybrid-ARQ error control system. Performance bounds were …

… Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for
a binary block code to exploit soft information obtained from the demodulator. This idea goes …

… on ZCmor’s decoder for F = GF(2), … minimum distance. The improvement is obtained by
inserting into the decoding algorithm features akin to generalized minimum distance decoding of …

… In this section we shall describe two different minimum distance decoding algorithms that
use the concept of zero neighbors. The first of these algorithms is based on a fundamental …

… In [15], we proposed an algorithm based on generalized minimum distance decoding (GMDD)
of the component codes. The proposed algorithm closes over 50% of the performance …