Abstract
In this paper, we study the stopping sets, stopping distance and stopping redundancy for binary linear codes. Stopping redundancy is a new concept proposed by Schwartz and Vardy recently for evaluating the performance of a linear code under iterative decoding over a binary erasure channel (BEC). Since the exact value of stopping redundancy is difficult to obtain in general, good lower and upper bounds are important. We obtain a new general upper bound on the stopping redundancy of binary linear codes which improves the corresponding results of Schwartz and Vardy.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Schwartz M, Vardy A. On the stopping distance and the stopping redundancy of codes. In Proc. IEEE Int. Symp. Inform. Theory, Adelaide, Australia, 2005, pp.975–979.
Schwartz M, Vardy A. On the stopping distance and the stopping redundancy of codes. IEEE Trans. Inform. Theory, 2006, 52(3): 922–932.
Kashyap N, Vardy A. Stopping sets in codes from designs. In Proc. IEEE Int. Symp. Inform. Theory, Yokohama, Japan, 2003, p.122.
Di C, Proietti D, Telatar I E et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inform. Theory, 2002, 48(6): 1570–1579.
Kou Y, Lin S, Fossorier M P C. Low-density parity-check codes based on finite geometries: A rediscovery and new results. IEEE Trans. Inform. Theory, 2001, 47(7): 2711–2736.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China under Grant No. 60402031, and the National Grand Fundamental Research 973 Program of China under Grant No. 2003CB314805.
Rights and permissions
About this article
Cite this article
Xia, ST. A Note on the Stopping Redundancy of Linear Codes. J Comput Sci Technol 21, 950–951 (2006). https://doi.org/10.1007/s11390-006-0950-7
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11390-006-0950-7