%0 Journal Article
%T A Note on the Stopping Redundancy of Linear Codes
%A Shu-Tao Xia
%A <br>Shu-Tao
%A Xia
%J 计算机科学技术学报
%D 2006
%I 
%X 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.
%K low-density parity-check (LDPC) codes
%K iterative decoding
%K stopping sets
%K stopping distance
%K stopping redundancy<br>低密度奇偶检测
%K 迭代译码
%K 停止距离
%K 停止冗余
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=19BDF83D9908973CB82E83087FC14022&yid=37904DC365DD7266&vid=659D3B06EBF534A7&iid=B31275AF3241DB2D&sid=114891522AE71A91&eid=9822743C2D2BE348&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=5