摘要
最近,Sobhani等人利用在有限群上的元素置换方法构造群置换LDPC码,本文在此基础上,给出了一类在有限域GF(16)的子群上构造的高码率的LDPC码,其Tanner图围长至少为8。仿真结果表明,这类码执行性能优于相应类型的随机LDPC码和其代数结构的准循环LDPC码。
Recently, Sobhani constructed group permutation LDPC codes from permutations associated with elements in a fi-nite group.Based on the work, a class of these high-rate codes for which the Tanner graphs with girth at least 8 associated with their parity-check matrices are presented .Simulation results show their good performance compared with random-like and quasi-cy-clic codes counterparts.
出处
《安庆师范学院学报(自然科学版)》
2014年第2期1-3,共3页
Journal of Anqing Teachers College(Natural Science Edition)
基金
国家自然科学基金(11326025
60773128)资助