Generalized minimum-distance decoding
id:
generalized-minimum-distance-decoding-316-13515249
title:
Generalized minimum-distance decoding
text:
In coding theory, generalized minimum-distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using an errors-and-erasures decoder for the outer code. A naive decoding algorithm for concatenated codes can not be an optimal way of decoding because it does not take into account the information that maximum likelihood decoding (MLD) gives. In other words, in the naive algorithm, inner received codewords are treated the same regardless of the differ
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Generalized_minimum-distance_decoding
date created:
date modified:
2023-10-24T01:36:45Z
main entity:
{"identifier":"Q15995090","url":"https://www.wikidata.org/entity/Q15995090"}
image:
fields total:
13
integrity:
13