This HTML5 document contains 29 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/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
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/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:Linear_programming_decoding
Subject Item
dbr:Linear_programming_decoding
rdf:type
dbo:Software
rdfs:label
Linear programming decoding
rdfs:comment
In information theory and coding theory, linear programming decoding (LP decoding) is a decoding method which uses concepts from linear programming (LP) theory to solve decoding problems. This approach was first used by Jon Feldman et al. They showed how the LP can be used to decode block codes. The basic idea behind LP decoding is to first represent the maximum likelihood decoding of a linear code as an integer linear program, and then relax the integrality constraints on the variables into linear inequalities.
dcterms:subject
dbc:Linear_programming
dbo:wikiPageID
20183658
dbo:wikiPageRevisionID
1094319051
dbo:wikiPageWikiLink
dbr:Coding_theory dbr:Linear_code dbr:Decoding_methods dbr:Integer_linear_programming dbr:Linear_programming_relaxation dbr:Maximum_likelihood_decoding dbr:Linear_programming dbc:Linear_programming dbr:Information_theory
owl:sameAs
freebase:m.04yfvfk n15:4qUHN wikidata:Q6553490
dbp:wikiPageUsesTemplate
dbt:Mathapplied-stub dbt:Short_description
dbo:abstract
In information theory and coding theory, linear programming decoding (LP decoding) is a decoding method which uses concepts from linear programming (LP) theory to solve decoding problems. This approach was first used by Jon Feldman et al. They showed how the LP can be used to decode block codes. The basic idea behind LP decoding is to first represent the maximum likelihood decoding of a linear code as an integer linear program, and then relax the integrality constraints on the variables into linear inequalities.
gold:hypernym
dbr:Method
prov:wasDerivedFrom
wikipedia-en:Linear_programming_decoding?oldid=1094319051&ns=0
dbo:wikiPageLength
1016
foaf:isPrimaryTopicOf
wikipedia-en:Linear_programming_decoding
Subject Item
dbr:LP_decoding
dbo:wikiPageWikiLink
dbr:Linear_programming_decoding
dbo:wikiPageRedirects
dbr:Linear_programming_decoding
Subject Item
wikipedia-en:Linear_programming_decoding
foaf:primaryTopic
dbr:Linear_programming_decoding