Referenced Items are not available for this document.
We present an efficient soft decision maximum likelihood decoding algorithm for linear binary block codes. As in the Chase algorithms, test error patterns are generated, added to the received sequence and decoded, using a hard decision decoder. However, the set of test error sequences is adaptively chosen. This significantly reduces decoding complexity. Furthermore a sub-optimal decoding algorithm is developed by introducing constraints on the set of test error patterns used.
Published in:
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Date of Conference: 2002
- Print ISBN:
- 0-7803-7501-7
- INSPEC Accession Number:
- 7643639
- Digital Object Identifier :
- 10.1109/ISIT.2002.1023586
- Product Type:
- Conference Publications
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.
