A Note on the Stopping Redundancy of Linear Codes

In this paper, westudy the stopping sets, stopping distance and stopping redundancyfor binary linear codes. Stopping redundancy is a new conceptproposed by Schwartz and Vardy recently for evaluating theperformance of a linear code under iterative decoding over abinary erasure channel (BEC). Since the exact value of stoppingredundancy is difficult to obtain in general, good lower and upperbounds are important. We obtain a new general upperbound on the stopping redundancy of binary linear codes whichimproves the corresponding results of Schwartz and Vardy.