On parity-check matrices with optimal stopping and/or dead-end set enumerators

Conference paper (2006)

Authors

KAS Abdel-Ghaffar External organisation

J.H. Weber Wireless and Mobile Communications

Jos Weber Wireless and Mobile Communications

Research Group

Wireless and Mobile Communications

To reference this document use:

http://resolver.tudelft.nl/uuid:008ce82b-c405-4ae5-8114-6ccbdf64f5c2

More Info

expand_more

Published Date

2006

Language

Undefined/Unknown

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Research Group

Wireless and Mobile Communications

Abstract

The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanner graph, or equivalently, the parity-check matrix representing the code. In this paper, we introduce the notion of dead-end sets to explicity demonstrate this dependency. The choice of the parity-check matrix entails a trade-off between performance and complexity. We give bounds on the complexity of iterative decoders achieving optimal performance in terms of the sizes of the underlying parity-check matrices. Further, we fully characterize codes for which the optimal stopping set enumerator equals the wieght enumerator.