摘要
SPC乘积码是一种既可以纠错,又可以恢复删除的高效码。该码的最小码距是4,能够恢复所有单阶,两阶和三阶的删除模式,实际上这种码能够恢复更高阶的删除模式。传统上是通过最小码间距来评价SPC乘积码译码性能,若从其空间结构入手,能够推导出SPC乘积码迭代译码后删除率的新上界。仿真显示这个上界更紧。
Product codes are powerful codes that can be used to correct errors or reco ver erasures.This code has a mini-mum distance of four and can thus be used to recover all single,double,and triple erasure patterns.Judging th e code perfor-mance based on its minimum distance i s very bad because the code is actuall y capable of recovering many higher e rasure pat-terns.This paper develops a new algo rithm for deriving an upper bound on t he post -decoding erasure rate for th e SPC product code with iterative decoding.
出处
《通信技术》
2003年第10期33-35,共3页
Communications Technology
关键词
SPC乘积码
删除模式
Simul ation shows that the derived bound is very tight.Single Parity Check product codes,e rasure,patterns
