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

KAS Abdel-Ghaffar; JH Weber

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

KAS Abdel-Ghaffar, JH Weber

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

3 Citations (Scopus)

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.

Original language	Undefined/Unknown
Title of host publication	Proceedings of the 2006 IEEE international symposium on information theory
Editors	s.n.
Place of Publication	s.l.
Publisher	IEEE Information Theory Society
Pages	1544-1548
Number of pages	5
ISBN (Print)	1424403677
Publication status	Published - 2006
Event	Conferentie, Seatlle, WA,USA - s.l. Duration: 9 Jul 2006 → 14 Jul 2006

Publication series

Name
Publisher	IEEE Information Theory Society

Conference

Conference	Conferentie, Seatlle, WA,USA
Period	9/07/06 → 14/07/06

Keywords

conference contrib. refereed
Conf.proc. > 3 pag

Cite this

@inproceedings{a4b3ee8dd3664d11b1dbf4598a1d032e,

title = "Stopping set enumerators of full-rank parity-check matrices of hamming codes",

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.",

keywords = "conference contrib. refereed, Conf.proc. > 3 pag",

author = "KAS Abdel-Ghaffar and JH Weber",

year = "2006",

language = "Undefined/Unknown",

isbn = "1424403677",

publisher = "IEEE Information Theory Society",

pages = "1544--1548",

editor = "s.n.",

booktitle = "Proceedings of the 2006 IEEE international symposium on information theory",

note = "Conferentie, Seatlle, WA,USA ; Conference date: 09-07-2006 Through 14-07-2006",

}

Stopping set enumerators of full-rank parity-check matrices of hamming codes. / Abdel-Ghaffar, KAS; Weber, JH.
Proceedings of the 2006 IEEE international symposium on information theory. ed. / s.n. s.l.: IEEE Information Theory Society, 2006. p. 1544-1548.

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

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

AU - Abdel-Ghaffar, KAS

AU - Weber, JH

PY - 2006

Y1 - 2006

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

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

KW - conference contrib. refereed

KW - Conf.proc. > 3 pag

M3 - Conference contribution

SN - 1424403677

SP - 1544

EP - 1548

BT - Proceedings of the 2006 IEEE international symposium on information theory

A2 - s.n., null

PB - IEEE Information Theory Society

CY - s.l.

T2 - Conferentie, Seatlle, WA,USA

Y2 - 9 July 2006 through 14 July 2006

ER -