DocumentCode
941994
Title
Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)
Author
Bossert, Martin ; Hergert, Ferdinand
Volume
32
Issue
5
fYear
1986
fDate
9/1/1986 12:00:00 AM
Firstpage
709
Lastpage
714
Abstract
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.
Keywords
Dual coding; Linear coding; Decoding; Design engineering; Error correction codes; Linear code; Linear programming; Notice of Violation; Parity check codes; Sufficient conditions; Vectors; Welding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1986.1057216
Filename
1057216
Link To Document