### Abstract

An attempt was made to study the asymptotic behavior of two quantities: the distribution of stopping sets, and the stopping number s^{z.ast;}-the size of the smallest nonempty stopping set in a code and use it to bound the error probability of LDPC codes with large blocklength. An expression for the normalized average stopping set distribution of regular and irregular LDPC codes was derived and used to obtain a critical fraction of the block length above which codes have exponentially many stopping sets of that size.

Original language | English (US) |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Pages | 123 |

Number of pages | 1 |

State | Published - 2003 |

Externally published | Yes |

Event | Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003 |

### Other

Other | Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) |
---|---|

Country | Japan |

City | Yokohama |

Period | 6/29/03 → 7/4/03 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*(pp. 123)

**Stopping set distribution of LDPC code ensembles.** / Orlitsky, Alon; Viswanathan, Krishnamurthy; Zhang, Junan.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Symposium on Information Theory - Proceedings.*pp. 123, Proceedings 2003 IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, 6/29/03.

}

TY - GEN

T1 - Stopping set distribution of LDPC code ensembles

AU - Orlitsky, Alon

AU - Viswanathan, Krishnamurthy

AU - Zhang, Junan

PY - 2003

Y1 - 2003

N2 - An attempt was made to study the asymptotic behavior of two quantities: the distribution of stopping sets, and the stopping number sz.ast;-the size of the smallest nonempty stopping set in a code and use it to bound the error probability of LDPC codes with large blocklength. An expression for the normalized average stopping set distribution of regular and irregular LDPC codes was derived and used to obtain a critical fraction of the block length above which codes have exponentially many stopping sets of that size.

AB - An attempt was made to study the asymptotic behavior of two quantities: the distribution of stopping sets, and the stopping number sz.ast;-the size of the smallest nonempty stopping set in a code and use it to bound the error probability of LDPC codes with large blocklength. An expression for the normalized average stopping set distribution of regular and irregular LDPC codes was derived and used to obtain a critical fraction of the block length above which codes have exponentially many stopping sets of that size.

UR - http://www.scopus.com/inward/record.url?scp=0141904678&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141904678&partnerID=8YFLogxK

M3 - Conference contribution

SP - 123

BT - IEEE International Symposium on Information Theory - Proceedings

ER -