Name
Title | ||
|---|---|---|
Extending the Dorsch decoder towards achieving maximum-likelihood decoding for linear codes |
Abstract | ||
|---|---|---|
It is shown that the relatively unknown Dorsch decoder may be extended to produce a decoder that is capable of maximum-likelihood decoding. The extension involves a technique for any linear (n, k) code that ensures that n-k less reliable, soft decisions of each received vector may be treated as erasures in determining candidate codewords. These codewords are derived from low information weight cod... |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1049/iet-com:20060338 | IET Communications |
Keywords | Field | DocType |
concatenated codes,correlation methods,linear codes,maximum likelihood decoding | Concatenated error correction code,Algorithm,BCH code,Viterbi decoder,Soft-decision decoder,Code word,Linear code,Decoding methods,Hamming bound,Mathematics | Journal |
Volume | Issue | ISSN |
1 | 3 | 1751-8628 |
Citations | PageRank | References |
4 | 0.41 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Tomlinson | 1 | 4 | 0.41 |
| C. Tjhai | 2 | 24 | 6.02 |
| A. Ambroze | 3 | 70 | 13.00 |