A Note on the Stopping Redundancy of Linear Codes  

作　　者：夏树涛 

机构地区：[1]The Graduate School at Shenzhen of Tsinghua University, Shenzhen 518055, P.R. China

出　　处：《Journal of Computer Science & Technology》2006年第6期950-951,共2页计算机科学技术学报（英文版）

摘　　要：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.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.

关 键 词：low-density parity-check （LDPC） codes iterative decoding stopping sets stopping distance stopping redundancy 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]