Linear programming decoding - Revision history

Erayatay: grammar

2022-06-21T22:28:23Z

grammar

← Previous revision		Revision as of 22:28, 21 June 2022
Line 1:		Line 1:
	{{Short description\|Decoding method}}		{{Short description\|Decoding method}}
	In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[linear programming]] (LP) theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to ~~decodes~~ block codes.		In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[linear programming]] (LP) theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> 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#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a [[linear code]] as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.		The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a [[linear code]] as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.

Sebastianleroy: #suggestededit-add 1.0

2022-02-22T00:30:42Z

#suggestededit-add 1.0

← Previous revision		Revision as of 00:30, 22 February 2022
Line 1:		Line 1:
			{{Short description\|Decoding method}}
	In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[linear programming]] (LP) theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.		In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[linear programming]] (LP) theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.

Marcocapelle: removed grandparent category of Category:Linear programming

2018-02-08T21:18:25Z

removed grandparent category of Category:Linear programming

← Previous revision		Revision as of 21:18, 8 February 2018
Line 9:		Line 9:
	{{mathapplied-stub}}		{{mathapplied-stub}}

	[[Category:Mathematical optimization]]
	[[Category:Linear programming]]		[[Category:Linear programming]]

Marcocapelle: removed Category:Operations research; added Category:Linear programming using HotCat

2018-02-06T22:41:07Z

removed Category:Operations research; added Category:Linear programming using HotCat

← Previous revision		Revision as of 22:41, 6 February 2018
Line 10:		Line 10:

	[[Category:Mathematical optimization]]		[[Category:Mathematical optimization]]
	[[Category:~~Operations~~ ~~research~~]]		[[Category:Linear programming]]

Duoduoduo: spell out acronym once more

2013-09-14T23:34:04Z

spell out acronym once more

← Previous revision		Revision as of 23:34, 14 September 2013
Line 1:		Line 1:
	In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[~~Linear~~ programming~~\|LP~~]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.		In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[linear programming]] (LP) theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.

	The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a [[linear code]] as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.		The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a [[linear code]] as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.

FrescoBot: Bot: link syntax/spacing

2012-08-12T04:26:50Z

Bot: link syntax/spacing

← Previous revision		Revision as of 04:26, 12 August 2012
Line 1:		Line 1:
	In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.		In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.

	The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a [[~~Linear_code\|~~linear code]] as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.		The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a [[linear code]] as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.

	== References ==		== References ==

Mhnova at 18:22, 1 August 2012

2012-08-01T18:22:47Z

← Previous revision		Revision as of 18:22, 1 August 2012
Line 1:		Line 1:
	In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.		In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.

	The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a linear ~~error-correcting~~ code as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.		The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a [[Linear_code\|linear code]] as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.

	== References ==		== References ==

Mhnova at 18:21, 1 August 2012

2012-08-01T18:21:12Z

← Previous revision		Revision as of 18:21, 1 August 2012
Line 1:		Line 1:
	In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.		In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.

			The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a linear error-correcting code as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.

	== References ==		== References ==

137.43.155.108 at 17:08, 10 June 2010

2010-06-10T17:08:54Z

← Previous revision		Revision as of 17:08, 10 June 2010
Line 1:		Line 1:
	In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how LP decodes block codes ~~with relaxation~~.		In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to decodes block codes.

	== References ==		== References ==

Jitse Niesen: reinstate categories deleted in edit before last; some formatting

2009-03-20T23:08:04Z

reinstate categories deleted in edit before last; some formatting

← Previous revision		Revision as of 23:08, 20 March 2009
Line 1:		Line 1:
	In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon [[Feldman]] et al. <ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref>		In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[Linear programming\|LP]] theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how LP decodes block codes with relaxation.

	they showed how LP decodes block codes with relaxation
	== References ==		== References ==
			<references/>


	{{reflist}}
			{{mathapplied-stub}}

			[[Category:Mathematical optimization]]
			[[Category:Operations research]]

← Previous revision		Revision as of 22:28, 21 June 2022
Line 1:		Line 1:
	{{Short description\|Decoding method}}		{{Short description\|Decoding method}}
	In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[linear programming]] (LP) theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> They showed how the LP can be used to ~~decodes~~ block codes.		In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods\|decoding]] method which uses concepts from [[linear programming]] (LP) theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.</ref> 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#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a [[linear code]] as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.		The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding\|maximum likelihood decoding]] of a [[linear code]] as an [[Integer_linear_programming\|integer linear program]], and then [[Linear_programming_relaxation\|relax]] the integrality constraints on the variables into linear inequalities.