About: Generalized minimum-distance decoding

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Generalized minimum-distance decoding Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatFiniteFields, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FGeneralized_minimum-distance_decoding&graph=http%3A%2F%2Fdbpedia.org&graph=http%3A%2F%2Fdbpedia.org

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.

Attributes	Values
rdf:type	yago:Field108569998 yago:GeographicalArea108574314 yago:Location100027167 yago:Object100002684 yago:PhysicalEntity100001930 yago:Region108630985 yago:YagoGeoEntity yago:YagoLegalActorGeo yago:YagoPermanentlyLocatedEntity yago:Tract108673395 yago:WikicatFiniteFields
rdfs:label	Generalized minimum-distance decoding (en)
rdfs:comment	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. (en)
dcterms:subject	Information theory Coding theory Error detection and correction Finite fields
Wikipage page ID	31707735 (xsd:integer)
Wikipage revision ID	987847854 (xsd:integer)
Link from a Wikipage to another Wikipage	Probability distribution Noisy channel Algorithm Deterministic algorithm Equality (mathematics) Concatenated error correction code Erasure code Berlekamp–Welch algorithm Information theory Coding theory Error Euclidean vector Expected value Lemma (mathematics) Probability density function David Forney Randomness Hamming distance Error detection and correction Finite fields Code Coding theory Soft-decision decoder Polynomial time Maximum likelihood decoding Randomized algorithm Real number Discrete random variable Linear Indicator variable Concatenated code Concatenated codes Reed Solomon Codeword Outer code
Link from a Wikipage to an external page	http://people.csail.mit.edu/madhu/FT01 http://www.cse.buffalo.edu/~atri/courses/coding-theory/lectures http://www.cse.buffalo.edu/~atri/courses/coding-theory/lectures/lect28.pdf http://www.cs.washington.edu/education/courses/cse533/06au
sameAs	Generalized minimum-distance decoding Generalized minimum-distance decoding Generalized minimum-distance decoding Generalized minimum-distance decoding
has abstract	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 difference between their hamming distances. Intuitively, the outer decoder should place higher confidence in symbols whose inner encodings are close to the received word. David Forney in 1966 devised a better algorithm called generalized minimum distance (GMD) decoding which makes use of those information better. This method is achieved by measuring confidence of each received codeword, and erasing symbols whose confidence is below a desired value. And GMD decoding algorithm was one of the first examples of soft-decision decoders. We will present three versions of the GMD decoding algorithm. The first two will be randomized algorithms while the last one will be a deterministic algorithm. (en)
prov:wasDerivedFrom	wikipedia-en:Generalized_minimum-distance_decoding?oldid=987847854&ns=0
page length (characters) of wiki page	12249 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Generalized_minimum-distance_decoding
is Link from a Wikipage to another Wikipage of	General minimum distance decoding Generalized minimum distance decoding
is Wikipage redirect of	General minimum distance decoding Generalized minimum distance decoding
is foaf:primaryTopic of	wikipedia-en:Generalized_minimum-distance_decoding

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software