Stopping set enumerators of full-rank parity-check matrices of hamming codes

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
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

In the 2004 Shanna Lecture, McEliece presented an expression for the number of stopping sets of size three for a full-rank parity-check matrix of the Hamming code. In this paper, we derive an expression for the number of stopping sets of any given size for the same parity-check matrix.