This HTML5 document contains 71 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n12http://www.cs.washington.edu/education/courses/cse533/
n16https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
n5http://people.csail.mit.edu/madhu/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
n17http://www.cse.buffalo.edu/~atri/courses/coding-theory/lectures/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n18http://www.cse.buffalo.edu/~atri/courses/coding-theory/

Statements

Subject Item
dbr:Generalized_minimum-distance_decoding
rdf:type
yago:YagoPermanentlyLocatedEntity yago:Field108569998 yago:YagoGeoEntity yago:Tract108673395 yago:PhysicalEntity100001930 yago:Region108630985 yago:WikicatFiniteFields yago:GeographicalArea108574314 yago:Location100027167 yago:Object100002684 yago:YagoLegalActorGeo
rdfs:label
Generalized minimum-distance decoding
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.
dcterms:subject
dbc:Error_detection_and_correction dbc:Finite_fields dbc:Information_theory dbc:Coding_theory
dbo:wikiPageID
31707735
dbo:wikiPageRevisionID
987847854
dbo:wikiPageWikiLink
dbr:Linear dbr:Expected_value dbr:Deterministic_algorithm dbr:Concatenated_code dbr:Discrete_random_variable dbr:Randomized_algorithm dbr:Concatenated_codes dbr:Error dbc:Error_detection_and_correction dbr:Algorithm dbr:Hamming_distance dbr:Coding_theory dbr:Probability_distribution dbr:Code dbr:Real_number dbr:Berlekamp–Welch_algorithm dbr:Indicator_variable dbr:Concatenated_error_correction_code dbr:Randomness dbc:Finite_fields dbr:Lemma_(mathematics) dbr:Probability_density_function dbr:Equality_(mathematics) dbr:Outer_code dbr:Maximum_likelihood_decoding dbr:Erasure_code dbr:David_Forney dbc:Coding_theory dbr:Reed_Solomon dbr:Soft-decision_decoder dbc:Information_theory dbr:Euclidean_vector dbr:Noisy_channel dbr:Polynomial_time dbr:Codeword
dbo:wikiPageExternalLink
n5:FT01 n12:06au n17:lect28.pdf n18:lectures
owl:sameAs
wikidata:Q15995090 freebase:m.0gtvd9b n16:b2QP yago-res:Generalized_minimum-distance_decoding
dbo: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.
prov:wasDerivedFrom
wikipedia-en:Generalized_minimum-distance_decoding?oldid=987847854&ns=0
dbo:wikiPageLength
12249
foaf:isPrimaryTopicOf
wikipedia-en:Generalized_minimum-distance_decoding
Subject Item
dbr:General_minimum_distance_decoding
dbo:wikiPageWikiLink
dbr:Generalized_minimum-distance_decoding
dbo:wikiPageRedirects
dbr:Generalized_minimum-distance_decoding
Subject Item
dbr:Generalized_minimum_distance_decoding
dbo:wikiPageWikiLink
dbr:Generalized_minimum-distance_decoding
dbo:wikiPageRedirects
dbr:Generalized_minimum-distance_decoding
Subject Item
wikipedia-en:Generalized_minimum-distance_decoding
foaf:primaryTopic
dbr:Generalized_minimum-distance_decoding