期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一类围长至少为6的QC-LDPC码的存在性 被引量：2

On the existence of a class of QC-LDPC codes with girth at least six
下载PDF
导出
摘要 对于列重为3和4,围长至少为6的QC-LDPC码,M.Hagiwara等学者最近研究了其循环置换矩阵(CPM)尺寸p的最小值,并提出了一个公开问题:当m大于等于50时,列重为4、行重为6m+3、p值为6m+3,且满足围长至少为6的QC-LDPC码是否存在?笔者基于矩阵复合的方法,证明了使这类QC-LDPC码存在的m有无穷多种. For QC-LDPC codes with column weights of three and four, and girth of at least six, M. Hagiwara et al recently investigated the smallest value of the dimension p of the cyclic permutation matrix, and remarked that for m greater than or equal to 50, the existence of QC-LDPC codes with column weight of four, row weight of 6m＋3, dimension of 6m＋3 and girth of at least six, remains open. By the method of matrix combination, it is proved in this paper that there exist infinite values of m which enable such codes to exist.
作者 张国华 王新梅
机构地区 西安电子科技大学综合业务网理论及关键技术国家重点实验室
出处 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2011年第3期136-139,149,共5页 Journal of Xidian University
基金 973资助项目(2010CB328300) 国家自然科学基金资助项目(U0635003 61001131) 111工程资助项目(B08038)
关键词 LDPC码 准循环 围长 存在性 low-density parity-check （LDPC） codes quasi-cyclic （QC） girth existence
分类号 TN911.22 [电子电信—通信与信息系统]
  • 相关文献

参考文献8

  • 1焦晓鹏,慕建君,周利华.一种Tanner图短环计数新方法[J].西安电子科技大学学报,2010,37(2):311-314. 被引量：7
  • 2Fossorier M P C.Quasi-Cyclic Low-Density Parity-Check Codes from Circulant Permutation Matrices[J].IEEE Trans on Inform Theory,2004,50(8):1788-1793.
  • 3Wang Y,Yedidia J S,Draper S C.Construction of High-Girth QC-LDPC Codes[C]//5th International Symposium on Turbo Codes and Related Topics.Lausanne:IEEE,2008:180-185.
  • 4Tao Xiongfei,Liu Weizhong,Zou Xuecheng.On the Construction of Low-Density Parity-Check Codes with Girth 10[J].International Journal of Electronics and Communications,2009,63(8):689-694.
  • 5O'Sullivan M E.Algebraic Construction of Sparse Matrices with Large Girth[J].IEEE Trans on Inform Theory,2006,52(2):718-727.
  • 6Hagiwara M,Nuida K,Kitagawa T,et al.On Minimal Length of Quasi Cyclic LDPC Codes with Girth 6[C]//Proc IEEE ISITA.Seoul:IEEE,2006:103-108.
  • 7Hagiwara M,Fossorier M P C,Kitagawa T,et al.Smallest Size of Circulant Matrix for Regular (3,L) and (4,L) Quasi-Cyclic LDPC Codes with Girth 6[J].IEICE Trans on Fundamentals,2009,E92-A(11):2891-2894.
  • 8Colboum C J,Dinitz J H.Handbook of Combinatorial Designs[M].Second Ed.Boca Raton:CRC Press,2006.

二级参考文献11

  • 1Gallager R G.Low-density Parity-check Codes[J].IRE Trans Information Theory,1962,8(1):21-28.
  • 2MacKay D J C,Neal R M.Near Shannon Limit Performance of Low Density Parity Check Codes[J].Electronics Letters,1997,32(18):1645-1646.
  • 3Richardson T J,Shokrollahi M A,Urbanke R.Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes[J].IEEE Trans on Information Theory,2001,47(2):619-637.
  • 4Tanner R M.A Recursive Approach to Low Complexity Codes[J].IEEE Trans on Information Theory,1981,27(5):533-547.
  • 5Halford T R,Chugg K M.An Algorithm for Counting Short Cycles in Bipartite Graphs[J].IEEE Trans on Information Theory,2006,52(1):287-292.
  • 6Fan J,Xiao Y.A Method of Counting the Number of Cycles in LDPC Codes[C]//The 8~(th) International Conference on Signal Processing(ICSP).Guilin:IEEE,2006:16-20.
  • 7Mao Y.Banihashemi A H.A Heurist Search for Good Low Density Parity-check Codes At Shon Block Lengths[C]//Proc Int Conf Communications.Helsinki:IEEE,2001:41-44.
  • 8Wu Xiaofu,Zhao Chunming,You Xiaohu,et al.Clustering of Cycles and Construction of LDPC Codes[C]//Proc IEEE GLOBECOM.New Orleans:IEEE,2008:1102-1105.
  • 9MacKay D J C.Encyclopedia of Sparse Graph Codes[DB/OL].[2008-09-04].http://www.inference.phy.cam.ac.uk./mackay/codes/data.html.
  • 10陈汝伟,黄华伟,杜小妮,丁勇,肖国镇.Tanner图中最短圈的计数[J].西安电子科技大学学报,2008,35(6):983-985. 被引量：2

共引文献6

同被引文献23

  • 1张焕明,叶梧,冯穗力.LDPC码的树图法构造[J].电讯技术,2007,47(4):166-168. 被引量：2
  • 2Baldi M,Chiaraluce F.Cryptanalysis of a New Instance of McEliece Cryptosystem Based on QC-LDPC Codes[C]//IEEE International Symposium on Information Theory.Piscataway:IEEE,2007:2591-2595.
  • 3Baldi M,Bodrato M,Chiaraluce F.A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes[C]//Security and Cryptography for Networks.Heidelberg:Springer Verlag,2008:246-262.
  • 4Baldi M,Bianchi M,Chiaraluce F.Security and Complexity of the McEliece Cryptosystem Based on QC-LDPC Codes[J/OL].[2012-10-15].http://arxiv.org/pdf/1109.5827v6.pdf.
  • 5Mceliece R J.A Public-Key Cryptosystem Based on Algebraic[EB/OL].[2012-12-01].http://www.cs.colorado.edu/～jrblack/class/csci7000/f03/papers/mceliece.pdf.
  • 6Lee P J,Brickell E F.An Observation on the Security of McEliece's Public-key Cryptosystem[C]//Workshop on the Theory and Application of Cryptographic Techniques.Berlin:Springer,1988:275-280.
  • 7Adams C M,Meijer H.Security-related Comments Regarding McEliece's Public-key Cryptosystem[J].IEEE Transactions on Information Theory,1989,35(2):454-455.
  • 8Sun H M.Improving the Security of the McEliece Public-key Cryptosystem[C]//International Conference on the Theory and Application of Cryptology and Information Security.Berlin:Springer-Verlag,1998:200-213.
  • 9M Fossorier.Quasicyclic low density parity checkcodes[].IEEE Transactions on Information Theory.2005
  • 10Gallager RG.Low-Density Parity-Check Codes[]..1963

引证文献2

二级引证文献1

西安电子科技大学学报
2011年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部