Springer eBooks

Soft-Decision Minimum-Distance Decoding

Patrick Guy Farrell

Published Jan 1, 1978• 2 citations

Publisher

DOI: 10.1007/978-94-011-7577-7_11

Related papers

A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search

Jun Asatani, Ken‐ichi Tomita, Takuya Koumoto +2 more

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesMar 12, 20022 citations

Soft-decision decoding algorithms and an evaluation method of error performance using a top-down and recursive minimum distance search

淳麻谷

Jan 1, 20030 citations

Soft-Input Soft-Output Decoding Algorithm Based on Iterative Minimum Distance Search for Reed-Muller Codes

Jun Asatani, Takuya Koumoto, Toru Fujiwara +1 more

IEEE International Symposium on Information Theory (ISIT)Dec 15, 20030 citations

An Iterative Soft-Decision Decoding Algorithm

Takuya Koumoto

Mar 22, 19960 citations

Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)

Martin Bossert, F. Hergert

A decoding algorithm for linear codes that uses the minimum weight words of the dual code as parity checks is defined. This algorithm is able to correct beyond the half minimum distance and has the capability of including soft-decision decoding. Results on applying this algorithm to quadratic residue (QR) codes, BCH codes, and the Golay codes (with and without soft-decision decoding) are presented.

IEEE Transactions on Information TheorySep 1, 198638 citations

Difference between two soft-decisiondecoding algorithms

Jan Nilsson

A relationship between two well-known soft-decision decoding algorithms is derived; the generalised minimum distance (GMD) algorithm and the Chase algorithm. The relation shows, in the case of soft-decision decoding of binary block codes, that the weakest third version of the Chase algorithm is more powerful than the GMD algorithm.

Electronics LettersSep 29, 19941 citation