In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods ofâ€¦Â (More)

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

Highly Cited

2011

Highly Cited

2011

- Ido Tal, Alexander Vardy
- IEEE Transactions on Information Theory
- 2011

We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successiveâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Siddharth Barman, Xishuo Liu, Stark C. Draper, Benjamin Recht
- IEEE Transactions on Information Theory
- 2011

When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decodingâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Babak Hassibi, Haris Vikalo
- IEEE Transactions on Signal Processing
- 2005

The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised ofâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Jon Feldman, Martin J. Wainwright, David R. Karger
- IEEE Transactions on Information Theory
- 2005

A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based onâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Pascal O. Vontobel, Ralf Koetter
- ArXiv
- 2005

The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterativeâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

We address an open question, regarding whether a lattice code with lattice decoding (as opposed to maximum-likelihood (MLâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Hossein Pishro-Nik, Faramarz Fekri
- IEEE Transactions on Information Theory
- 2004

This paper investigates decoding of low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We study theâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Sergio Benedetto, Dariush Divsalar, Guido Montorsi, Fabrizio Pollara
- IEEE Trans. Information Theory
- 1998

A serially concatenated code with an interleaver consists of the cascade of an outer code, an interleaver permuting the outerâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Madhu Sudan
- J. Complexity
- 1997

We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F Ã— F (where F is a field) andâ€¦Â (More)

Is this relevant?

Highly Cited

1985