Stopping sets in codes from designs
Kashyap, N.
Vardy, A.
Dept. of Electr. Eng., California Univ., San Diego, La Jolla, CA, USA;
This paper appears in: Information Theory, 2003. Proceedings. IEEE International Symposium on
Publication Date: 29 June-4 July 2003
On page(s): 122-
ISBN: 0-7803-7728-1
INSPEC Accession Number: 8095470
Digital Object Identifier: 10.1109/ISIT.2003.1228136
Current Version Published: 2003-09-15
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
