Distributed decoding of rectangular parity-check code

Distributed decoding of rectangular parity-check code

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

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

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
Your details
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.

Distributed iterative decoding of the rectangular parity-check code between two receiving nodes is performed. Simulation results show that a close-to-full diversity advantage can be achieved using the proposed scheme, which requires exchanging only a small amount of information between the two nodes.


    1. 1)
      • J.G. Proakis . (1989) Digital Communications.
    2. 2)
      • J. Hagenauer , E. Offer , L. Papke . Iterative decoding of binary block and convolutional codes. IEEE Trans. Inform. Theory , 429 - 445
    3. 3)
      • Wong, T.F., Shea, J.M.: `Multi-dimensional parity check codes for bursty channels', Proc. 2001 IEEE Int. Symp. Information Theory, June 2001, Washington, DC, USA, p. 123.
    4. 4)
      • Wong, T.F., Shea, J.M., Li, X.: `Using multi-dimensional parity-check codes to obtain diversity in Rayleigh fading channels', Proc. IEEE Globecom, November 2001, San Antonio, TX, USA, p. 1210–1214.

Related content

This is a required field
Please enter a valid email address