Probabilistic hard-decision table look-up decoding for binary block codes

Access Full Text

Probabilistic hard-decision table look-up decoding for binary block codes

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

A probabilistic hard-decision decoding algorithm based on the weight distribution of binary block codes and the random error distribution in the channel is briefly described. It reduces the number of look-up iterations performed in the conventional exhaustive search table look-up minimum distance decoder.

Inspec keywords: decoding; error correction codes

Other keywords: search table look-up minimum distance decoder; look-up iterations; random error distribution; probabilistic hard-decision decoding algorithm; weight distribution; binary block codes

Subjects: Codes

References

    1. 1)
      • Lin Shu . (1970) , An introduction to error-correcting codes.
    2. 2)
      • J.K. Macwilliams , N.J. Sloane . (1977) , The theory of error correcting codes.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19840627
Loading

Related content

content/journals/10.1049/el_19840627
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading