### Abstract

The size of the smallest stopping set in a low-density parity check (LDPC) code determines, to an extent, the performance of iterative decoding methods over the binary erasure channel. In an LDPC code arising from a block design, a stopping set is a subset of its blocks with the property that every point belonging to one of the selected blocks belongs to at least two of them. While some Steiner triple systems have no stopping sets of size 5 or less, it is shown that every Steiner triple system has a stopping set of size at most 7. The proof can be viewed as an application of polynomial identities among configuration counts that generalize the family of known linear identities. While no example of a Steiner triple system whose smallest stopping set has size seven is known, it is shown that a partial Steiner triple system on v points with c·v^{1.8} triples that has no stopping set of size less than 7 exists.

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

Pages (from-to) | 31-46 |

Number of pages | 16 |

Journal | Cryptography and Communications |

Volume | 1 |

Issue number | 1 |

DOIs | |

State | Published - Apr 2009 |

### Keywords

- Low-density parity check code
- Steiner triple systems
- Stopping sets

### ASJC Scopus subject areas

- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Small stopping sets in Steiner triple systems'. Together they form a unique fingerprint.

## Cite this

*Cryptography and Communications*,

*1*(1), 31-46. https://doi.org/10.1007/s12095-008-0002-y