检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《Science China Mathematics》2008年第11期1989-1999,共11页中国科学:数学(英文版)
基 金:the National Natural Science Foundation of China (Grant Nos. 10471091, 10671027);Foundation of Shanghai Education Committee (Grant No. 06FZ029);"One Hundred Talents Program" from University of Science and Technology of China
摘 要:This paper provides a fast algorithm for Grobner bases of homogenous ideals of F[x, y] over a finite field F. We show that only the S-polynomials of neighbor pairs of a strictly ordered finite homogenours generating set are needed in the computing of a Grobner base of the homogenous ideal. It reduces dramatically the number of unnecessary S-polynomials that are processed. We also show that the computational complexity of our new algorithm is O(N2), where N is the maximum degree of the input generating polynomials. The new algorithm can be used to solve a problem of blind recognition of convolutional codes. This problem is a new generalization of the important problem of synthesis of a linear recurring sequence.Both original and twisted Schrdinger-Virasoro algebras, and also their deformations were introduced and investigated in a series of papers by Henkel, Roger and Unterberger. In the present paper we aim at determining the 2-cocycles of original deformative Schrdinger-Virasoro algebras.
关 键 词:homogenous ideal Grobner basis sequence synthesis Berlekamp-Massey algorithm
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.106.172