By Topic

Efficient decoding of interleaved linear block codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Haslach, C. ; Inst. for Exp. Math., Essen Univ., Germany ; Vinck, A.J.H.

The error correction capability of interleaved linear block codes is discussed. We assume that the channel behaves such that each row of a received array is either error free or corrupted by many symbol errors. Provided that the error vectors are linearly independent, we show that some interleaved block codes can correct asymptotically one erroneous row per redundant row, even without having reliability information from the channel output. An efficient decoding algorithm that achieves the error correction capability is presented. Using this algorithm we derive a random access scheme that has many similarities with the Aloha system. This paper represents a generalization of previous work (see IEEE Trans. Inform. Theory, vol.45, no.7, pp.2339-45, Nov. 1999). As it finally turned out, many ideas had already been discussed by Metzner and Kapturowski (see IEEE Trans. Inform. Theory, vol.36, no.4, pp.911-17, July 1990)

Published in:

Information Theory, 2000. Proceedings. IEEE International Symposium on

Date of Conference:

2000