Referenced Items are not available for this document.
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.
Published in:
Information Theory, IEEE Transactions on
(Volume:32
,
Issue:
5
)
Date of Publication: Sep 1986
- Page(s):
- 709 - 714
- ISSN :
- 0018-9448
- Digital Object Identifier :
- 10.1109/TIT.1986.1057216
- Date of Current Version :
- 06 January 2003
- Issue Date :
- Sep 1986
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
