Stopping sets in codes from designs

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2003Publisher:IEEEJournal:IEEE International Symposium on Information Theory, 2003. Proceedings.

Authors: N. Kashyap; A. Vardy;

doi: 10.1109/isit.2003.1228136

Stopping sets in codes from designs

- Summary
- Metrics

Abstract

The size of the smallest stopping set in LDPC codes helps in analyzing their performance under iterative decoding, just a minimum distance helps in analyzing the performance under maximum likelihood decoding. We study stopping sets in LDPC codes arising from 2-designs, in particular LDPC codes derived from projective and Euclidean geometries. We derive upper and lower bounds on the size of the smallest stopping set in such codes, and provide examples of codes that achieve these bounds.

Related Organizations

University of California, San Diego
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	32
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%