Generalized minimum-distance decoding: Difference between revisions

Content deleted Content added
Yeonju (talk | contribs)
No edit summary
Marked as dead end (Deadendmarker is an automated bot.)
Line 1:
{{deadend|date=May 2011}}
 
==Introduction==
In coding theory, Generalized Minimum Distance(GMD) Decoding provides an efficient algorithm for decoding [http://en.wikipedia.org/wiki/Concatenated_code concatenated codes], which is based on using an errors-and-[http://en.wikipedia.org/wiki/Erasure_code erasures] decoder for the [http://en.wikipedia.org/wiki/Concatenated_code outer code].