Title :
Stopping sets in codes from designs
Author :
Kashyap, Navin ; Vardy, Alexander
Author_Institution :
Dept. of Electr. Eng., California Univ., San Diego, La Jolla, CA, USA
fDate :
29 June-4 July 2003
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.
Keywords :
iterative decoding; maximum likelihood decoding; parity check codes; Euclidean geometry; iterative decoding; low-density parity-check code; maximum likelihood decoding; projective geometry; stopping set; Bismuth; Drives; Geometry; Iterative decoding; Linear code; Maximum likelihood decoding; Parity check codes; Performance analysis;
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
DOI :
10.1109/ISIT.2003.1228136
