Abstract
This paper provides a fast algorithm for Gröbner bases of homogenous ideals of the ring double-struck F sign[x, y] over a field double-struck F sign. The computational complexity of the 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 is a new generalization of the important problem of synthesis of a linear recurring sequence. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Lu, P., & Zou, Y. (2007). Fast computations of Gröbner bases and blind recognitions of convolutional codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4547 LNCS, pp. 303–317). Springer Verlag. https://doi.org/10.1007/978-3-540-73074-3_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
