## Improved Upper Bounds on Stopping Redundancy (2007)

### Cached

### Download Links

- [vivaldi.ucsd.edu:8080]
- [cmrr-star.ucsd.edu]
- [arxiv.org]
- DBLP

### Other Repositories/Bibliography

by
Junsheng Han
,
Paul H. Siegel

Citations: | 21 - 3 self |

### BibTeX

@MISC{Han07improvedupper,

author = {Junsheng Han and Paul H. Siegel},

title = {Improved Upper Bounds on Stopping Redundancy},

year = {2007}

}

### OpenURL

### Abstract

For a linear block code with minimum distance d, its stopping redundancy is the minimum number of check nodes in a Tanner graph representation of the code, such that all nonempty stopping sets have size d or larger. We derive new upper bounds on stopping redundancy for all linear codes in general, and for maximum distance separable (MDS) codes specifically, and show how they improve upon previous results. For MDS codes, the new bounds are found by upper-bounding the stopping redundancy by a combinatorial quantity closely related to Turán numbers. (The Turán number, „