Generalized minimum-distance decoding: Difference between revisions

Revision as of 20:53, 29 March 2013

Revision as of 21:09, 29 March 2013

Line 1:

{{Orphan|date=May 2011}}

In [[coding theory]], '''generalized minimum-distance (GMD) decoding''' provides an efficient [[algorithm]] for decoding [[concatenated code]]s, which is based on using an [[error]]s-and-[[Erasure code|erasures]] [[decoder]] for the [[outer code]].