首页> 外文会议>International Conference on Computational Intelligence and Security >Girth Analysis of Tanner (5,11) Quasi-Cyclic LDPC Codes
【24h】

Girth Analysis of Tanner (5,11) Quasi-Cyclic LDPC Codes

机译:Tanner(5,11)准循环LDPC码的周长分析

获取原文
获取外文期刊封面目录资料

摘要

Motivated by the works on the girth of Tanner (3,5), (3,7), (3,11), and (5,7) quasi-cyclic (QC) LDPC codes, we in this paper study the girth of Tanner (5,11) QC-LDPC codes. We first analyze the cycles of Tanner (5,11) QC-LDPC codes, and obtain the conditions for the existence of cycles of length less than 12 in Tanner (5,11) QC-LDPC codes of length 11p where p is a prime number and p =1 (mod 55). Notice that the condition is represented by the polynomial equations in a 55th root of unity of the prime field Fp. By checking the existence of solutions for these equations over Fp, the girths of Tanner (5,11) QC-LDPC codes are obtained.
机译:基于Tanner(3,5),(3,7),(3,11)和(5,7)准循环(QC)LDPC码的周长的工作,我们在本文中研究了Tanner(5,11)QC-LDPC码。我们首先分析Tanner(5,11)QC-LDPC码的周期,并获得长度为11p的Tanner(5,11)QC-LDPC码中长度小于12的周期存在的条件,其中p是素数数和p = 1(mod 55)。注意,该条件由素数场Fp的第55个单位根中的多项式方程表示。通过检查在Fp上这些方程的解的存在性,可以获得Tanner(5,11)QC-LDPC码的周长。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号