Stopping set enumerators of full-rank parity-check matrices of hamming codes
Conference Paper
(2006)
Author(s)
KAS Abdel-Ghaffar (External organisation)
J.H. Weber (TU Delft - Wireless and Mobile Communications)
Research Group
Wireless and Mobile Communications
To reference this document use:
https://resolver.tudelft.nl/uuid:a4b3ee8d-d366-4d11-b1db-f4598a1d032e
More Info
expand_more
expand_more
Publication Year
2006
Research Group
Wireless and Mobile Communications
Pages (from-to)
1544-1548
ISBN (print)
1424403677
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.
No files available
Metadata only record. There are no files for this record.