Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2011

Highly Cited

2011

When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

Polar codes are the first codes to provably achieve capacity on the symmetric binary-input discrete memoryless channel (B-DMC… Expand

Is this relevant?

2008

2008

In this paper, we propose a new linear programming formulation for the decoding of general linear block codes. Different from the… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints… Expand

Is this relevant?

2008

2008

A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates LP… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

We consider linear-programming (LP) decoding of low-density parity-check (LDPC) codes. While it is clear that one can use any… Expand

Is this relevant?

2006

2006

A method and apparatus for dry forming a paper, or other nonwoven web, from fibers or fiber flocs. The flocs or bundles are… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on… Expand

Is this relevant?

2003

2003

Given a linear code and observations from a noisy channel, the decoding problem is to de- termine the most likely (ML) codeword… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Error-correcting codes are fundamental tools used to transmit digital information over unreliable channels. Their study goes back… Expand

Is this relevant?