基于可变拟阵搜索算法构造码率为1/p的二进制系统准循环码  

Construct the Systematic Binary Quasi-cyclic Codes with Rate 1/p Based on Variable Matroid Search Algorithm

作　　者：张水平[1] 林平平[1] 巫光福[1] 江林伟 

机构地区：[1]江西理工大学信息工程学院,赣州341000

出　　处：《电子与信息学报》2016年第11期2916-2921,共6页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(11461031;61562037);江西省自然科学基金(20151BAB217016)

摘　　要：该文针对拟阵搜索算法复杂度高以及局部拟阵搜索算法无法搜索到全部最优码的问题,通过研究拟阵搜索算法,提出可变拟阵搜索算法,并用于搜索准循环码。该算法通过减少重复搜索从而降低运算复杂度;基于该算法构造码率为1/p的二进制系统准循环码,随着整数p的变化,生成矩阵减少或者增加一个循环矩阵,产生码率均为1/p的最优码。通过实验得到两个最小距离比现有最优码更大的准循环码,表明算法的可行性和优越性。Because the matroid search algorithm is very complicated and the local matroid search algorithm can not search all optimal codes, this paper proposes a variable matroid search algorithm to search the quasi-cyclic codes by researching matroid search algorithm. The algorithm reduces the computational complexity by reducing the repeated search. Based on this algorithm, the systematic binary quasi-cyclic codes of which the rate is 1/p are constructed. With the change of integer p, the optimal codes of rate 1/p can be obtained by the generator matrix reducing or adding a loop matrix. Through experiments, two new codes of which the minimum distance is larger than the existing optimal codes are worked out, which indicate the feasibility and superiority of the algorithm.

关 键 词：拟阵理论 准循环码 最小距离 可变拟阵搜索算法 

分 类 号：TN911.22[电子电信—通信与信息系统]