使用演化计算求解生成循环码的合法码字  

Recovering Legal-Codes of Generated Cyclic Codes by Evolutionary Computation

作　　者：李康顺[1] 李元香[1] 吴志健[1] 

机构地区：[1]武汉大学软件工程国家重点实验室

出　　处：《计算机工程与应用》2004年第17期15-17,共3页Computer Engineering and Applications

基　　金：国家自然科学重点基金项目(编号:60133010);高等学校博士学科点专项科研基金项目(编号:20030486049)

摘　　要：编码纠错、检错是计算机应用中最重要的操作手段之一,也是软件、硬件设计中必不可少的一个重要环节。目前,求解域GF(q)中多项式g(x)的生成多项式(g(x))的合法码字的方法有多种,文章认为比较好的一种方法就是利用求解高阶多项式g(x)的根来求出它的生成多项式(g(x))的合法码字。求解域GF(q)中高阶多项式的根通常非常困难,该文介绍一种使用演化计算来求解生成循环码的合法码字的方法。One of the most important issues in computer applications is to detect and correct error codes,which is also a crucial step in software and hardware design.Numerous methods have been recently proposed to recover legal-codes of the generated polynomial(g(x))of the exponential polynomial of higher degree.We think that a better approach for this purpose is to recover legal-codes by finding the roots of the polynomial.However,as it is well known,finding roots of polynomials of higher degree in domain GF(q)is very difficult.We shall propose a method to recover legal-codes of generated cyclic codes by evolutionary computation,which makes use of randomized searching method from biological natural selection and natural genetic system.

关 键 词：循环码 合法码字 演化计算 多项式 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]