Details:
Title  Fast computations of Gr\"obner bases and blind recognitions of convolutional codes.  Author(s)  PeiZhong Lu, Yan Zou  Type  Book, Chapter in Book, Conference Proceeding  Abstract  This paper provides a fast algorithm for Gröbner bases of homogenous ideals of the ring 𝔽[x,y] over a field 𝔽. The computational complexity of the algorithm is O(N 2), 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 is a new generalization of the important problem of synthesis of a linear recurring sequence  Keywords  Gröbner basis, sequence synthesis, BerlekampMassey algorithm  ISBN  9783540730736/pbk 
URL 
http://link.springer.com/chapter/10.1007%2F9783540730743_24 
Language  English  Pages  303317  Publisher  Berlin: Springer  Year  2007  Edition  0  Translation 
No  Refereed 
No 
