vardy造句

• Theory , 2006 , 52 : 922 - 932 . 3 kashyap n , vardy a . stopping sets in codes from designs
  停止集元素个数的最小值称为停止距离stopping distance ，记为s h 。
• 1 schwartz m , vardy a . on the stopping distance and the stopping redundancy of codes . in proc . ieee int
  停止集s是位置集合1 , 2 , , n的子集，使得h在s上的投影不包含重量为1的行。
• We obtain a new general upper bound on the stopping redundancy of binary linear codes which improves the corresponding results of schwartz and vardy
  设c为二元线性码， n为码长， d为极小距离， h为校验矩阵， gh为h对应的tanner图。
• Theory , adelaide , australia , 2005 , pp . 975 - 979 . 2 schwartz m , vardy a . on the stopping distance and the stopping redundancy of codes . ieee trans
  从tanner图的观点来看，停止集s是gh中变量节点的子集使得s邻居的每一个校验节点与s相连的边数大于等于2 。
• Theory , 2002 , 48 : 1570 - 1579 . 5 kou y , lin s , fossorier m p c . low - density parity - check codes based on finite geometries : a rediscovery and new results . ieee trans
  Schwartz和vardy在2005年得到以下结果：任给校验矩阵h0 ，一定可以通过增加冗余行得到新的校验矩阵h使得停止距离s h达到上界d 。
• 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 . since the exact value of stopping redundancy is difficult to obtain in general , good lower and upper bounds are important
  近年来，迭代译码的性能分析是低密度校验ldpc码研究领域的热点问题之一， di等人在2001年指出：迭代译码在二元删除信道bec中的性能可以由ldpc码的停止集stopping set完全刻画。