Referenced Items are not available for this document.
An approach to fast maximum likelihood decoding of some binary codes is presented. The binary codewords are regarded as images of some C/sub g/ group code, called the projected code, defined over an Abelian group A. The neighbourhood of z, z/spl isin/A/sup N/, the vector of symbol-by-symbol soft decoding, is examined to identify the most likely codeword of C/sub g/. A small list of candidate codewords is prepared by employing certain elimination rules. A substantial reduction of computational complexity is achieved by this method.
Published in:
Electrical and Electronics Engineers in Israel, 1995., Eighteenth Convention of
Date of Conference: 7-8 March 1995
- Page(s):
- 5.1.3/1 - 5.1.3/5
- Meeting Date :
- 07 Mar 1995-08 Mar 1995
- Print ISBN:
- 0-7803-2498-6
- INSPEC Accession Number:
- 5188530
- Conference Location :
- Tel Aviv, Israel
- Digital Object Identifier :
- 10.1109/EEIS.1995.514177
- 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.
